./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0d5288dd00c9a47ff4965115e87370b3520a01ad27a1d9991d0865749a0e86d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:20:38,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:20:38,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:20:38,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:20:38,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:20:38,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:20:38,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:20:38,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:20:38,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:20:38,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:20:38,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:20:38,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:20:38,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:20:38,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:20:38,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:20:38,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:20:38,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:20:38,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:20:38,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:20:38,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:20:38,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:20:38,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:20:38,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:20:38,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:20:38,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:20:38,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:20:38,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:20:38,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:20:38,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:20:38,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:20:38,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:20:38,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:20:38,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:20:38,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:20:38,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:20:38,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:20:38,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:20:38,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:20:38,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:20:38,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:20:38,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:20:38,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:20:38,582 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-clean/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-clean/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 -> 0d5288dd00c9a47ff4965115e87370b3520a01ad27a1d9991d0865749a0e86d6 [2024-10-11 09:20:38,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:20:38,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:20:38,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:20:38,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:20:38,812 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:20:38,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-64.i [2024-10-11 09:20:40,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:20:40,250 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:20:40,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-64.i [2024-10-11 09:20:40,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c8c4ce409/0e7b80f91ad24184ba2d6f61abac306e/FLAGf667fddc6 [2024-10-11 09:20:40,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c8c4ce409/0e7b80f91ad24184ba2d6f61abac306e [2024-10-11 09:20:40,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:20:40,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:20:40,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:20:40,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:20:40,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:20:40,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3501c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40, skipping insertion in model container [2024-10-11 09:20:40,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:20:40,443 WARN L248 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-co_file-64.i[919,932] [2024-10-11 09:20:40,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:20:40,511 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:20:40,541 WARN L248 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-co_file-64.i[919,932] [2024-10-11 09:20:40,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:20:40,617 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:20:40,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40 WrapperNode [2024-10-11 09:20:40,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:20:40,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:20:40,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:20:40,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:20:40,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,662 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-11 09:20:40,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:20:40,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:20:40,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:20:40,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:20:40,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,693 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-10-11 09:20:40,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:20:40,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:20:40,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:20:40,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:20:40,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (1/1) ... [2024-10-11 09:20:40,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:20:40,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:20:40,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:20:40,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:20:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:20:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:20:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:20:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:20:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:20:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:20:40,855 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:20:40,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:20:41,146 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 09:20:41,146 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:20:41,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:20:41,172 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:20:41,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:41 BoogieIcfgContainer [2024-10-11 09:20:41,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:20:41,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:20:41,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:20:41,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:20:41,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:20:40" (1/3) ... [2024-10-11 09:20:41,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e685fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:41, skipping insertion in model container [2024-10-11 09:20:41,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:40" (2/3) ... [2024-10-11 09:20:41,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e685fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:41, skipping insertion in model container [2024-10-11 09:20:41,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:41" (3/3) ... [2024-10-11 09:20:41,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-64.i [2024-10-11 09:20:41,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:20:41,193 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:20:41,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:20:41,244 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;@621a4f8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:20:41,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:20:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:20:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:20:41,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:20:41,262 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:20:41,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:20:41,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:20:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -970457214, now seen corresponding path program 1 times [2024-10-11 09:20:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:20:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442132710] [2024-10-11 09:20:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:20:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:20:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:20:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:20:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:20:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:20:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:20:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:20:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:20:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:20:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:20:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:20:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:20:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:20:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:20:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:20:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:20:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:20:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:20:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:20:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:20:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:20:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:20:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:20:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:20:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:20:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:20:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:20:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:20:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:20:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:20:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:20:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 09:20:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:20:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:20:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:20:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:20:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 09:20:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:20:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 09:20:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 09:20:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:20:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442132710] [2024-10-11 09:20:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442132710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:20:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:20:41,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:20:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020471184] [2024-10-11 09:20:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:20:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:20:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:20:41,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:20:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:20:41,816 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 09:20:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:20:41,865 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2024-10-11 09:20:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:20:41,867 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 233 [2024-10-11 09:20:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:20:41,875 INFO L225 Difference]: With dead ends: 193 [2024-10-11 09:20:41,875 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 09:20:41,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-10-11 09:20:41,883 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:20:41,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:20:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 09:20:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 09:20:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:20:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 153 transitions. [2024-10-11 09:20:41,935 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 153 transitions. Word has length 233 [2024-10-11 09:20:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:20:41,935 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 153 transitions. [2024-10-11 09:20:41,936 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 09:20:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 153 transitions. [2024-10-11 09:20:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:20:41,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:20:41,941 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:20:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:20:41,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:20:41,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:20:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1662277506, now seen corresponding path program 1 times [2024-10-11 09:20:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:20:41,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093908312] [2024-10-11 09:20:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:20:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:20:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:20:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:20:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:20:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:20:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:20:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:20:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:20:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:20:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:20:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:20:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:20:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:20:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:20:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:20:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:20:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:20:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:20:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:20:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:20:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:20:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:20:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:20:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:20:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:20:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:20:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:20:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:20:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:20:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:20:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:20:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 09:20:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:20:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:20:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:20:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:20:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 09:20:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:20:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 09:20:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 09:20:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:20:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093908312] [2024-10-11 09:20:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093908312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:20:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:20:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:20:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309465105] [2024-10-11 09:20:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:20:44,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:20:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:20:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:20:44,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:20:44,424 INFO L87 Difference]: Start difference. First operand 96 states and 153 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:20:44,844 INFO L93 Difference]: Finished difference Result 344 states and 547 transitions. [2024-10-11 09:20:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:20:44,844 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 09:20:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:20:44,850 INFO L225 Difference]: With dead ends: 344 [2024-10-11 09:20:44,851 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 09:20:44,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 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-10-11 09:20:44,853 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 189 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:20:44,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 647 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:20:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 09:20:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 110. [2024-10-11 09:20:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:20:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2024-10-11 09:20:44,886 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 233 [2024-10-11 09:20:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:20:44,890 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2024-10-11 09:20:44,890 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2024-10-11 09:20:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:20:44,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:20:44,892 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:20:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:20:44,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:20:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:20:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1088288386, now seen corresponding path program 1 times [2024-10-11 09:20:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:20:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378649869] [2024-10-11 09:20:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:20:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:20:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:20:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:20:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:20:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:20:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:20:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:20:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:20:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:20:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:20:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:20:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:20:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:20:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:20:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:20:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:20:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:20:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:20:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:20:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:20:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:20:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:20:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:20:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:20:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:20:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:20:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:20:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:20:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:20:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:20:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:20:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 09:20:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:20:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:20:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:20:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:20:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 09:20:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:20:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 09:20:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 09:20:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:20:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378649869] [2024-10-11 09:20:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378649869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:20:45,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:20:45,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:20:45,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080744625] [2024-10-11 09:20:45,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:20:45,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:20:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:20:45,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:20:45,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:20:45,190 INFO L87 Difference]: Start difference. First operand 110 states and 177 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:20:45,431 INFO L93 Difference]: Finished difference Result 318 states and 505 transitions. [2024-10-11 09:20:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:20:45,431 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 09:20:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:20:45,435 INFO L225 Difference]: With dead ends: 318 [2024-10-11 09:20:45,435 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 09:20:45,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 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-10-11 09:20:45,437 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 166 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:20:45,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 827 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:20:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 09:20:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 110. [2024-10-11 09:20:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:20:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2024-10-11 09:20:45,447 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 233 [2024-10-11 09:20:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:20:45,448 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2024-10-11 09:20:45,448 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2024-10-11 09:20:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:20:45,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:20:45,450 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:20:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:20:45,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:20:45,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:20:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2099405636, now seen corresponding path program 1 times [2024-10-11 09:20:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:20:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612925196] [2024-10-11 09:20:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:20:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:20:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:20:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:20:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:20:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:20:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:20:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:20:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:20:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:20:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:20:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:20:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:20:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:20:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:20:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:20:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:20:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:20:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:20:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:20:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:20:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:20:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:20:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:20:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:20:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:20:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:20:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:20:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:20:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:20:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:20:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:20:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 09:20:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:20:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:20:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:20:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:20:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 09:20:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:20:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 09:20:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:20:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 09:20:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:20:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612925196] [2024-10-11 09:20:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612925196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:20:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:20:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:20:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229061503] [2024-10-11 09:20:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:20:48,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:20:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:20:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:20:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:20:48,081 INFO L87 Difference]: Start difference. First operand 110 states and 177 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:20:48,343 INFO L93 Difference]: Finished difference Result 313 states and 496 transitions. [2024-10-11 09:20:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:20:48,344 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 233 [2024-10-11 09:20:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:20:48,346 INFO L225 Difference]: With dead ends: 313 [2024-10-11 09:20:48,346 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 09:20:48,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:20:48,347 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 157 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:20:48,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 647 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:20:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 09:20:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 96. [2024-10-11 09:20:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:20:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 152 transitions. [2024-10-11 09:20:48,366 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 152 transitions. Word has length 233 [2024-10-11 09:20:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:20:48,366 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 152 transitions. [2024-10-11 09:20:48,366 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, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 09:20:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 152 transitions. [2024-10-11 09:20:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 09:20:48,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:20:48,369 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:20:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:20:48,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:20:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:20:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -112589373, now seen corresponding path program 1 times [2024-10-11 09:20:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:20:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768661786] [2024-10-11 09:20:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:20:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:20:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat