./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:18:42,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:18:42,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:18:42,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:18:42,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:18:42,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:18:42,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:18:42,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:18:42,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:18:42,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:18:42,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:18:42,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:18:42,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:18:42,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:18:42,475 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:18:42,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:18:42,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:18:42,475 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:18:42,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:18:42,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:18:42,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:18:42,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:18:42,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:18:42,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:18:42,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:18:42,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:18:42,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:18:42,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:18:42,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:18:42,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:18:42,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:18:42,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:18:42,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:18:42,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:18:42,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:18:42,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:18:42,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:18:42,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:18:42,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:18:42,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:18:42,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:18:42,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:18:42,485 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b [2024-10-24 07:18:42,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:18:42,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:18:42,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:18:42,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:18:42,749 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:18:42,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-24 07:18:44,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:18:44,296 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:18:44,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-24 07:18:44,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03f9457d/a6906ca023444c6e814eb17bc26458fb/FLAG99e9e2483 [2024-10-24 07:18:44,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03f9457d/a6906ca023444c6e814eb17bc26458fb [2024-10-24 07:18:44,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:18:44,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:18:44,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:18:44,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:18:44,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:18:44,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f98fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44, skipping insertion in model container [2024-10-24 07:18:44,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:18:44,554 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-10-24 07:18:44,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:18:44,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:18:44,648 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-10-24 07:18:44,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:18:44,704 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:18:44,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44 WrapperNode [2024-10-24 07:18:44,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:18:44,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:18:44,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:18:44,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:18:44,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,771 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-10-24 07:18:44,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:18:44,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:18:44,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:18:44,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:18:44,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,809 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-24 07:18:44,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:18:44,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:18:44,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:18:44,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:18:44,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (1/1) ... [2024-10-24 07:18:44,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:18:44,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:18:44,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:18:44,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:18:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:18:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:18:44,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:18:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:18:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:18:44,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:18:45,020 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:18:45,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:18:45,586 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:18:45,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:18:45,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:18:45,629 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:18:45,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:18:45 BoogieIcfgContainer [2024-10-24 07:18:45,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:18:45,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:18:45,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:18:45,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:18:45,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:18:44" (1/3) ... [2024-10-24 07:18:45,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbc7094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:18:45, skipping insertion in model container [2024-10-24 07:18:45,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:44" (2/3) ... [2024-10-24 07:18:45,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbc7094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:18:45, skipping insertion in model container [2024-10-24 07:18:45,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:18:45" (3/3) ... [2024-10-24 07:18:45,641 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-24 07:18:45,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:18:45,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:18:45,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:18:45,726 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;@71f229bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:18:45,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:18:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 07:18:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 07:18:45,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:45,747 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:45,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1895209208, now seen corresponding path program 1 times [2024-10-24 07:18:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693670786] [2024-10-24 07:18:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:45,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:18:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:18:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:18:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:18:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:18:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:18:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:18:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:18:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:18:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:18:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:18:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:18:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:18:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:18:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:18:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:18:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:18:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:18:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:18:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:18:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:18:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:18:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:18:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:18:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:18:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:18:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:18:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 07:18:46,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:18:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693670786] [2024-10-24 07:18:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693670786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:18:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:18:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:18:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059489018] [2024-10-24 07:18:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:18:46,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:18:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:18:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:18:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:18:46,272 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 07:18:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:18:46,321 INFO L93 Difference]: Finished difference Result 167 states and 305 transitions. [2024-10-24 07:18:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:18:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-10-24 07:18:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:18:46,335 INFO L225 Difference]: With dead ends: 167 [2024-10-24 07:18:46,336 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 07:18:46,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-24 07:18:46,345 INFO L432 NwaCegarLoop]: 130 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, 130 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-24 07:18:46,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:18:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 07:18:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 07:18:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 54 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 07:18:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2024-10-24 07:18:46,412 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 170 [2024-10-24 07:18:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:18:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-10-24 07:18:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 07:18:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2024-10-24 07:18:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 07:18:46,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:46,421 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:18:46,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1418918254, now seen corresponding path program 1 times [2024-10-24 07:18:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331273261] [2024-10-24 07:18:46,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:18:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:18:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:18:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:18:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:18:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:18:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:18:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:18:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:18:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:18:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:18:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:18:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:18:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:18:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:18:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:18:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:18:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:18:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:18:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:18:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:18:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:18:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:18:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:18:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:18:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:18:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:18:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 07:18:47,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:18:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331273261] [2024-10-24 07:18:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331273261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:18:47,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:18:47,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:18:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704211691] [2024-10-24 07:18:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:18:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:18:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:18:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:18:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:18:47,200 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:18:47,404 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2024-10-24 07:18:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:18:47,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2024-10-24 07:18:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:18:47,411 INFO L225 Difference]: With dead ends: 248 [2024-10-24 07:18:47,413 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 07:18:47,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-24 07:18:47,417 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 85 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:18:47,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 384 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:18:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 07:18:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2024-10-24 07:18:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 07:18:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 206 transitions. [2024-10-24 07:18:47,462 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 206 transitions. Word has length 170 [2024-10-24 07:18:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:18:47,463 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 206 transitions. [2024-10-24 07:18:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 206 transitions. [2024-10-24 07:18:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 07:18:47,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:47,469 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:47,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:18:47,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1948396473, now seen corresponding path program 1 times [2024-10-24 07:18:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971943168] [2024-10-24 07:18:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:18:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:18:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:18:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:18:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:18:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:18:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:18:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:18:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:18:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:47,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:18:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:18:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:18:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:18:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:18:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:18:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:18:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:18:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:18:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:18:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:18:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:18:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:18:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:18:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:18:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:18:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:18:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:18:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 07:18:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:18:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971943168] [2024-10-24 07:18:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971943168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:18:48,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:18:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:18:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913879777] [2024-10-24 07:18:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:18:48,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:18:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:18:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:18:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:18:48,053 INFO L87 Difference]: Start difference. First operand 130 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:18:48,551 INFO L93 Difference]: Finished difference Result 292 states and 466 transitions. [2024-10-24 07:18:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:18:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-24 07:18:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:18:48,555 INFO L225 Difference]: With dead ends: 292 [2024-10-24 07:18:48,555 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 07:18:48,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:18:48,557 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 265 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:18:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 217 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:18:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 07:18:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 145. [2024-10-24 07:18:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 07:18:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 232 transitions. [2024-10-24 07:18:48,595 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 232 transitions. Word has length 171 [2024-10-24 07:18:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:18:48,597 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 232 transitions. [2024-10-24 07:18:48,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 232 transitions. [2024-10-24 07:18:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 07:18:48,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:48,603 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:18:48,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1891138171, now seen corresponding path program 1 times [2024-10-24 07:18:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258876839] [2024-10-24 07:18:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:18:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:18:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:18:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:18:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:18:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:18:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:18:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:18:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:18:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:18:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:18:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:18:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:18:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:18:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:18:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:18:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:18:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:18:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:18:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:18:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:18:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:18:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:18:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:18:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:18:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:18:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:18:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 07:18:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:18:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258876839] [2024-10-24 07:18:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258876839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:18:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:18:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:18:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926363355] [2024-10-24 07:18:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:18:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:18:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:18:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:18:48,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:18:48,955 INFO L87 Difference]: Start difference. First operand 145 states and 232 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:18:49,122 INFO L93 Difference]: Finished difference Result 378 states and 612 transitions. [2024-10-24 07:18:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:18:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-24 07:18:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:18:49,128 INFO L225 Difference]: With dead ends: 378 [2024-10-24 07:18:49,129 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 07:18:49,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-24 07:18:49,131 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 131 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:18:49,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 415 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:18:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 07:18:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 240. [2024-10-24 07:18:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-24 07:18:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 385 transitions. [2024-10-24 07:18:49,204 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 385 transitions. Word has length 171 [2024-10-24 07:18:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:18:49,206 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 385 transitions. [2024-10-24 07:18:49,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 07:18:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 385 transitions. [2024-10-24 07:18:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 07:18:49,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:49,211 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:49,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:18:49,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:49,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash 711858297, now seen corresponding path program 1 times [2024-10-24 07:18:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303686924] [2024-10-24 07:18:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:18:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:18:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:18:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:18:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:18:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:18:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:18:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:18:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:18:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:18:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:18:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:18:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:18:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:18:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:18:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:18:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:18:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:18:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:18:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:18:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:18:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:18:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:18:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:18:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:18:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:18:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:18:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 07:18:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:18:49,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303686924] [2024-10-24 07:18:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303686924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:18:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640787085] [2024-10-24 07:18:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:49,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:18:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:18:49,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:18:49,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:18:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:49,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 07:18:49,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:18:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 819 proven. 105 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 07:18:51,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:18:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 07:18:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640787085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:18:52,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:18:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 24 [2024-10-24 07:18:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044002275] [2024-10-24 07:18:52,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:18:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 07:18:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:18:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 07:18:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-10-24 07:18:52,151 INFO L87 Difference]: Start difference. First operand 240 states and 385 transitions. Second operand has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) [2024-10-24 07:18:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:18:57,209 INFO L93 Difference]: Finished difference Result 1024 states and 1572 transitions. [2024-10-24 07:18:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-24 07:18:57,210 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) Word has length 172 [2024-10-24 07:18:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:18:57,218 INFO L225 Difference]: With dead ends: 1024 [2024-10-24 07:18:57,218 INFO L226 Difference]: Without dead ends: 832 [2024-10-24 07:18:57,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1892, Invalid=9238, Unknown=0, NotChecked=0, Total=11130 [2024-10-24 07:18:57,224 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1287 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:18:57,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1761 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 07:18:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-24 07:18:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 381. [2024-10-24 07:18:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 261 states have internal predecessors, (343), 105 states have call successors, (105), 16 states have call predecessors, (105), 16 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 07:18:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 553 transitions. [2024-10-24 07:18:57,301 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 553 transitions. Word has length 172 [2024-10-24 07:18:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:18:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 553 transitions. [2024-10-24 07:18:57,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) [2024-10-24 07:18:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 553 transitions. [2024-10-24 07:18:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 07:18:57,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:18:57,304 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:18:57,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 07:18:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:18:57,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:18:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:18:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash 750693170, now seen corresponding path program 1 times [2024-10-24 07:18:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:18:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142474525] [2024-10-24 07:18:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:18:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:18:57,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43782630] [2024-10-24 07:18:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:18:57,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:18:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:18:57,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:18:57,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:18:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:18:57,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 07:18:57,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:18:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-10-24 07:18:59,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:19:28,192 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:19:43,302 WARN L286 SmtUtils]: Spent 9.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:19:50,176 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:19:54,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_10 Int)) (or (< v_z_10 .cse3) (< v_z_10 .cse1) (< .cse4 v_z_10) (not (= (mod (* v_z_10 .cse2) 4294967296) v_z_10)))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2024-10-24 07:20:03,311 WARN L286 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:20:12,047 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:20:18,784 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)