./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_codestructure_dependencies_file-28.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_codestructure_dependencies_file-28.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 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:06:58,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:06:58,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:06:58,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:06:58,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:06:58,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:06:58,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:06:58,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:06:58,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:06:58,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:06:58,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:06:58,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:06:58,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:06:58,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:06:58,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:06:58,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:06:58,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:06:58,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:06:58,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:06:58,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:06:58,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:06:58,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:06:58,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:06:58,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:06:58,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:06:58,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:06:58,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:06:58,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:06:58,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:06:58,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:06:58,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:06:58,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:06:58,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:06:58,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:06:58,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:06:58,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:06:58,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:06:58,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:06:58,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:06:58,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:06:58,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:06:58,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:06:58,604 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 -> 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 [2024-10-11 07:06:58,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:06:58,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:06:58,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:06:58,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:06:58,919 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:06:58,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2024-10-11 07:07:00,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:07:00,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:07:00,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2024-10-11 07:07:00,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9bb211a7/fb3f25d7012f47f8b688aef2803ad999/FLAGa185d9949 [2024-10-11 07:07:01,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9bb211a7/fb3f25d7012f47f8b688aef2803ad999 [2024-10-11 07:07:01,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:07:01,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:07:01,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:07:01,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:07:01,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:07:01,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b84d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01, skipping insertion in model container [2024-10-11 07:07:01,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:07:01,239 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_codestructure_dependencies_file-28.i[919,932] [2024-10-11 07:07:01,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:07:01,334 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:07:01,345 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_codestructure_dependencies_file-28.i[919,932] [2024-10-11 07:07:01,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:07:01,405 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:07:01,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01 WrapperNode [2024-10-11 07:07:01,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:07:01,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:07:01,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:07:01,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:07:01,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,479 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-11 07:07:01,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:07:01,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:07:01,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:07:01,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:07:01,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,524 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 07:07:01,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:07:01,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:07:01,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:07:01,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:07:01,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (1/1) ... [2024-10-11 07:07:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:07:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:07:01,618 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 07:07:01,622 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 07:07:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:07:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:07:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:07:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:07:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:07:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:07:01,775 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:07:01,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:07:02,232 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 07:07:02,233 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:07:02,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:07:02,267 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:07:02,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:07:02 BoogieIcfgContainer [2024-10-11 07:07:02,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:07:02,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:07:02,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:07:02,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:07:02,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:07:01" (1/3) ... [2024-10-11 07:07:02,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e82e6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:07:02, skipping insertion in model container [2024-10-11 07:07:02,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:07:01" (2/3) ... [2024-10-11 07:07:02,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e82e6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:07:02, skipping insertion in model container [2024-10-11 07:07:02,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:07:02" (3/3) ... [2024-10-11 07:07:02,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-28.i [2024-10-11 07:07:02,297 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:07:02,297 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:07:02,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:07:02,377 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;@1da59d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:07:02,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:07:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:07:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 07:07:02,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:02,402 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:02,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1366063618, now seen corresponding path program 1 times [2024-10-11 07:07:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523947114] [2024-10-11 07:07:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:07:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:07:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:07:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:07:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:07:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:07:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:07:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:07:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:07:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:07:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:07:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:07:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:07:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:07:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:07:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:07:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:07:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:07:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:07:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:07:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:07:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:07:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:07:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:07:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523947114] [2024-10-11 07:07:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523947114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:07:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:07:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:07:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270818355] [2024-10-11 07:07:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:07:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:07:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:07:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:07:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:07:02,922 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:07:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:02,976 INFO L93 Difference]: Finished difference Result 129 states and 228 transitions. [2024-10-11 07:07:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:07:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137 [2024-10-11 07:07:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:02,991 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:07:02,991 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:07:02,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 07:07:03,002 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:03,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:07:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:07:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:07:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:07:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-11 07:07:03,054 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 137 [2024-10-11 07:07:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:03,055 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-11 07:07:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:07:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-11 07:07:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 07:07:03,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:03,058 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:07:03,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:03,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 954828986, now seen corresponding path program 1 times [2024-10-11 07:07:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:03,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538575160] [2024-10-11 07:07:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:07:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:07:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:07:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:07:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:07:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:07:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:07:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:07:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:07:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:07:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:07:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:07:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:07:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:07:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:07:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:07:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:07:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:07:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:07:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:07:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:07:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:07:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:07:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:07:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538575160] [2024-10-11 07:07:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538575160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:07:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:07:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:07:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328200876] [2024-10-11 07:07:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:07:23,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:07:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:07:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:07:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:07:23,236 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:24,961 INFO L93 Difference]: Finished difference Result 251 states and 386 transitions. [2024-10-11 07:07:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:07:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2024-10-11 07:07:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:24,967 INFO L225 Difference]: With dead ends: 251 [2024-10-11 07:07:24,967 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 07:07:24,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:07:24,969 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 365 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:24,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 388 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:07:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 07:07:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 134. [2024-10-11 07:07:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:07:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 211 transitions. [2024-10-11 07:07:25,005 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 211 transitions. Word has length 137 [2024-10-11 07:07:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:25,006 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 211 transitions. [2024-10-11 07:07:25,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 211 transitions. [2024-10-11 07:07:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 07:07:25,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:25,009 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:07:25,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1347855996, now seen corresponding path program 1 times [2024-10-11 07:07:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071360709] [2024-10-11 07:07:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:07:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:07:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:07:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:07:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:07:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:07:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:07:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:07:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:07:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:07:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:07:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:07:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:07:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:07:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:07:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:07:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:07:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:07:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:07:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:07:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:07:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:07:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:07:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:07:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071360709] [2024-10-11 07:07:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071360709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:07:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:07:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:07:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666502318] [2024-10-11 07:07:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:07:48,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:07:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:07:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:07:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:07:48,719 INFO L87 Difference]: Start difference. First operand 134 states and 211 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:07:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:50,955 INFO L93 Difference]: Finished difference Result 335 states and 515 transitions. [2024-10-11 07:07:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:07:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137 [2024-10-11 07:07:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:50,960 INFO L225 Difference]: With dead ends: 335 [2024-10-11 07:07:50,961 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 07:07:50,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:07:50,967 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 323 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:50,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 505 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 07:07:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 07:07:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 139. [2024-10-11 07:07:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:07:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 220 transitions. [2024-10-11 07:07:51,004 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 220 transitions. Word has length 137 [2024-10-11 07:07:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 220 transitions. [2024-10-11 07:07:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:07:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 220 transitions. [2024-10-11 07:07:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 07:07:51,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:51,011 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:07:51,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash 538509370, now seen corresponding path program 1 times [2024-10-11 07:07:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416729036] [2024-10-11 07:07:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:07:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:07:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:07:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:07:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:07:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:07:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:07:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:07:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:07:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:07:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:07:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:07:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:07:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:07:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:07:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:07:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:07:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:07:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:07:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:07:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:07:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:07:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:07:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:07:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416729036] [2024-10-11 07:07:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416729036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:07:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:07:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:07:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953790967] [2024-10-11 07:07:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:07:51,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:07:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:07:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:07:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:07:51,174 INFO L87 Difference]: Start difference. First operand 139 states and 220 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:51,444 INFO L93 Difference]: Finished difference Result 388 states and 616 transitions. [2024-10-11 07:07:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:07:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2024-10-11 07:07:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:51,451 INFO L225 Difference]: With dead ends: 388 [2024-10-11 07:07:51,451 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 07:07:51,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:07:51,453 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 247 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:51,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 370 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:07:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 07:07:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 150. [2024-10-11 07:07:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:07:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2024-10-11 07:07:51,479 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 137 [2024-10-11 07:07:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2024-10-11 07:07:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2024-10-11 07:07:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 07:07:51,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:51,482 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:07:51,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1655893564, now seen corresponding path program 1 times [2024-10-11 07:07:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102769606] [2024-10-11 07:07:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:07:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:07:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:07:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:07:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:07:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:07:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:07:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:07:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:07:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:07:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:07:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:07:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:07:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:07:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:07:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:07:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:07:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:07:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:07:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:07:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:07:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:07:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:07:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:07:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102769606] [2024-10-11 07:07:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102769606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:07:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:07:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:07:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66188308] [2024-10-11 07:07:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:07:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:07:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:07:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:07:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:07:51,729 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:51,866 INFO L93 Difference]: Finished difference Result 469 states and 725 transitions. [2024-10-11 07:07:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:07:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2024-10-11 07:07:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:51,871 INFO L225 Difference]: With dead ends: 469 [2024-10-11 07:07:51,873 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 07:07:51,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:07:51,874 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 111 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:51,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:07:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 07:07:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 276. [2024-10-11 07:07:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 183 states have (on average 1.3770491803278688) internal successors, (252), 183 states have internal predecessors, (252), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 07:07:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 428 transitions. [2024-10-11 07:07:51,930 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 428 transitions. Word has length 137 [2024-10-11 07:07:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 428 transitions. [2024-10-11 07:07:51,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 428 transitions. [2024-10-11 07:07:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 07:07:51,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:51,935 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:51,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:07:51,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:51,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash -679308188, now seen corresponding path program 1 times [2024-10-11 07:07:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:07:51,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43739057] [2024-10-11 07:07:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:07:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:08:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:08:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:08:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:08:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:08:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:08:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:08:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:08:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:08:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:08:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:08:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:08:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:08:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:08:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:08:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:08:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:08:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:08:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:08:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:08:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:08:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:08:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:08:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:08:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:08:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43739057] [2024-10-11 07:08:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43739057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:08:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:08:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:08:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497378199] [2024-10-11 07:08:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:08:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:08:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:08:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:08:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:08:15,730 INFO L87 Difference]: Start difference. First operand 276 states and 428 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:08:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:08:17,596 INFO L93 Difference]: Finished difference Result 502 states and 769 transitions. [2024-10-11 07:08:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:08:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2024-10-11 07:08:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:08:17,603 INFO L225 Difference]: With dead ends: 502 [2024-10-11 07:08:17,603 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 07:08:17,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:08:17,605 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 261 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:08:17,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 430 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 07:08:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 07:08:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 274. [2024-10-11 07:08:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 181 states have (on average 1.3701657458563536) internal successors, (248), 181 states have internal predecessors, (248), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 07:08:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 424 transitions. [2024-10-11 07:08:17,650 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 424 transitions. Word has length 138 [2024-10-11 07:08:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:08:17,652 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 424 transitions. [2024-10-11 07:08:17,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:08:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 424 transitions. [2024-10-11 07:08:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 07:08:17,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:08:17,654 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:08:17,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:08:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:08:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -818895187, now seen corresponding path program 1 times [2024-10-11 07:08:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:08:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006910320] [2024-10-11 07:08:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:08:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:08:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat