./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash feaa0156af8515c11e53760c56b6153bee93f0fe9288c23521b275fb865500c1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:12:19,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:12:19,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:12:19,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:12:19,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:12:19,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:12:19,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:12:19,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:12:19,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:12:19,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:12:19,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:12:19,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:12:19,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:12:19,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:12:19,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:12:19,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:12:19,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:12:19,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:12:19,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:12:19,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:12:19,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:12:19,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:12:19,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:12:19,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:12:19,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:12:19,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:12:19,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:12:19,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:12:19,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:12:19,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:12:19,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:12:19,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:12:19,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:12:19,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:12:19,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:12:19,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:12:19,125 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> feaa0156af8515c11e53760c56b6153bee93f0fe9288c23521b275fb865500c1 [2024-11-08 21:12:19,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:12:19,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:12:19,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:12:19,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:12:19,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:12:19,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-08 21:12:20,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:12:20,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:12:20,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-08 21:12:20,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9fc9946/526486569ef94f3a93d2867d7e29a67b/FLAG920321b3d [2024-11-08 21:12:21,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9fc9946/526486569ef94f3a93d2867d7e29a67b [2024-11-08 21:12:21,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:12:21,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:12:21,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:21,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:12:21,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:12:21,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c723ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21, skipping insertion in model container [2024-11-08 21:12:21,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:12:21,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i[919,932] [2024-11-08 21:12:21,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:21,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:12:21,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i[919,932] [2024-11-08 21:12:21,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:12:21,393 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:12:21,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21 WrapperNode [2024-11-08 21:12:21,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:12:21,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:21,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:12:21,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:12:21,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,447 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-08 21:12:21,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:12:21,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:12:21,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:12:21,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:12:21,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,483 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:12:21,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:12:21,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:12:21,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:12:21,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:12:21,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (1/1) ... [2024-11-08 21:12:21,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:12:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:12:21,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:12:21,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:12:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:12:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:12:21,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:12:21,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:12:21,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:12:21,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:12:21,652 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:12:21,654 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:12:21,908 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:12:21,908 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:12:21,922 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:12:21,922 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:12:21,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:21 BoogieIcfgContainer [2024-11-08 21:12:21,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:12:21,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:12:21,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:12:21,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:12:21,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:12:21" (1/3) ... [2024-11-08 21:12:21,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d25397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:21, skipping insertion in model container [2024-11-08 21:12:21,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:12:21" (2/3) ... [2024-11-08 21:12:21,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d25397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:12:21, skipping insertion in model container [2024-11-08 21:12:21,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:12:21" (3/3) ... [2024-11-08 21:12:21,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-64.i [2024-11-08 21:12:21,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:12:21,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:12:21,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:12:22,001 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@430067b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:12:22,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:12:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 21:12:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 21:12:22,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:22,016 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:22,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 586108561, now seen corresponding path program 1 times [2024-11-08 21:12:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329199780] [2024-11-08 21:12:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:12:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:12:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:12:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:12:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:12:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:12:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:12:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:12:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:12:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:12:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:12:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 21:12:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 21:12:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 21:12:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329199780] [2024-11-08 21:12:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329199780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:12:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552411181] [2024-11-08 21:12:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:12:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:22,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:12:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:12:22,498 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 21:12:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:22,526 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-08 21:12:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:12:22,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-08 21:12:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:22,533 INFO L225 Difference]: With dead ends: 173 [2024-11-08 21:12:22,535 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 21:12:22,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:12:22,540 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:22,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:12:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 21:12:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 21:12:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 21:12:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-08 21:12:22,575 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 183 [2024-11-08 21:12:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:22,576 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-08 21:12:22,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 21:12:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-08 21:12:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 21:12:22,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:22,579 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:22,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:12:22,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash -574138027, now seen corresponding path program 1 times [2024-11-08 21:12:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465641203] [2024-11-08 21:12:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:12:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:12:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:12:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:12:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:12:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:12:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:12:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:12:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:12:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:12:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:12:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 21:12:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 21:12:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 21:12:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465641203] [2024-11-08 21:12:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465641203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:23,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:12:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914516295] [2024-11-08 21:12:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:23,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:12:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:12:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:12:23,035 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:23,261 INFO L93 Difference]: Finished difference Result 320 states and 495 transitions. [2024-11-08 21:12:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:12:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 21:12:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:23,265 INFO L225 Difference]: With dead ends: 320 [2024-11-08 21:12:23,265 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 21:12:23,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:12:23,270 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 242 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:23,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 560 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:12:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 21:12:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 101. [2024-11-08 21:12:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 21:12:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-08 21:12:23,295 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 183 [2024-11-08 21:12:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-08 21:12:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-08 21:12:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 21:12:23,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:23,300 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:12:23,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1595206381, now seen corresponding path program 1 times [2024-11-08 21:12:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706344067] [2024-11-08 21:12:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:12:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:12:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:12:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:12:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:12:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:12:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:12:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:12:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:12:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:12:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:12:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 21:12:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 21:12:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 21:12:23,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706344067] [2024-11-08 21:12:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706344067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:23,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:12:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087470459] [2024-11-08 21:12:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:23,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:12:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:12:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:12:23,585 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:23,765 INFO L93 Difference]: Finished difference Result 335 states and 519 transitions. [2024-11-08 21:12:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:12:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 21:12:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:23,769 INFO L225 Difference]: With dead ends: 335 [2024-11-08 21:12:23,769 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 21:12:23,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:12:23,773 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 221 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:23,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 622 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:12:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 21:12:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 101. [2024-11-08 21:12:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 21:12:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-08 21:12:23,790 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 183 [2024-11-08 21:12:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:23,791 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-08 21:12:23,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-08 21:12:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 21:12:23,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:23,793 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:23,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:12:23,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1273592405, now seen corresponding path program 1 times [2024-11-08 21:12:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310383061] [2024-11-08 21:12:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:12:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:12:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:12:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:12:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:12:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:12:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:12:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:12:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:12:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:12:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:12:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:12:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:12:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:12:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:12:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:12:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:12:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:12:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:12:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 21:12:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:12:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 21:12:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:12:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:12:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:12:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:12:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 21:12:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 21:12:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:12:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 21:12:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:12:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310383061] [2024-11-08 21:12:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310383061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:12:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:12:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:12:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621680717] [2024-11-08 21:12:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:12:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:12:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:12:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:12:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:12:25,919 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:12:26,106 INFO L93 Difference]: Finished difference Result 262 states and 407 transitions. [2024-11-08 21:12:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:12:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 21:12:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:12:26,109 INFO L225 Difference]: With dead ends: 262 [2024-11-08 21:12:26,109 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 21:12:26,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:12:26,110 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 145 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:12:26,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 710 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:12:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 21:12:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 86. [2024-11-08 21:12:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 21:12:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-08 21:12:26,121 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 183 [2024-11-08 21:12:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:12:26,122 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-08 21:12:26,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 21:12:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-08 21:12:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 21:12:26,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:12:26,124 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:12:26,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:12:26,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:12:26,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:12:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1755683920, now seen corresponding path program 1 times [2024-11-08 21:12:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:12:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298875382] [2024-11-08 21:12:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:12:26,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:12:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat