./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.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_codestructure_dependencies_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:10:48,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:10:48,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:10:48,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:10:48,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:10:48,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:10:48,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:10:48,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:10:48,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:10:48,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:10:48,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:10:48,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:10:48,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:10:48,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:10:48,674 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:10:48,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:10:48,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:10:48,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:10:48,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:10:48,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:10:48,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:10:48,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:10:48,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:10:48,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:10:48,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:10:48,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:10:48,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:10:48,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:10:48,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:10:48,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:10:48,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:10:48,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:10:48,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:10:48,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:10:48,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:10:48,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:10:48,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:10:48,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:10:48,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:10:48,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:10:48,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:10:48,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:10:48,694 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 -> 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 [2024-10-24 05:10:48,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:10:48,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:10:48,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:10:48,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:10:48,995 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:10:48,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i [2024-10-24 05:10:50,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:10:50,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:10:50,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i [2024-10-24 05:10:50,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51173e259/9f2fa323f2bc402fb1dbd0320f3cd209/FLAG42e695bf9 [2024-10-24 05:10:50,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51173e259/9f2fa323f2bc402fb1dbd0320f3cd209 [2024-10-24 05:10:50,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:10:50,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:10:50,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:10:50,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:10:50,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:10:50,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:50,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9606ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50, skipping insertion in model container [2024-10-24 05:10:50,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:50,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:10:50,876 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i[919,932] [2024-10-24 05:10:50,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:10:50,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:10:50,943 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i[919,932] [2024-10-24 05:10:50,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:10:50,990 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:10:50,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50 WrapperNode [2024-10-24 05:10:50,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:10:50,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:10:50,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:10:50,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:10:50,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,035 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-24 05:10:51,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:10:51,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:10:51,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:10:51,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:10:51,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,063 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 05:10:51,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:10:51,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:10:51,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:10:51,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:10:51,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (1/1) ... [2024-10-24 05:10:51,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:10:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:10:51,122 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 05:10:51,127 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 05:10:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:10:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:10:51,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:10:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:10:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:10:51,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:10:51,260 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:10:51,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:10:51,577 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 05:10:51,578 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:10:51,633 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:10:51,633 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:10:51,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:10:51 BoogieIcfgContainer [2024-10-24 05:10:51,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:10:51,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:10:51,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:10:51,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:10:51,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:10:50" (1/3) ... [2024-10-24 05:10:51,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12319e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:10:51, skipping insertion in model container [2024-10-24 05:10:51,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:50" (2/3) ... [2024-10-24 05:10:51,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12319e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:10:51, skipping insertion in model container [2024-10-24 05:10:51,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:10:51" (3/3) ... [2024-10-24 05:10:51,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-64.i [2024-10-24 05:10:51,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:10:51,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:10:51,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:10:51,753 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;@183ea45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:10:51,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:10:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:10:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 05:10:51,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:51,775 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:51,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1178305342, now seen corresponding path program 1 times [2024-10-24 05:10:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:10:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246379942] [2024-10-24 05:10:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:10:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:10:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:10:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:10:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:10:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:10:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:10:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:10:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:10:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:10:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:10:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:10:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:10:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:10:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:10:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:10:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:10:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:10:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:10:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:10:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:10:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:10:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:10:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:10:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:10:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:10:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:10:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:10:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:10:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246379942] [2024-10-24 05:10:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246379942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:10:52,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:10:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:10:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505726837] [2024-10-24 05:10:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:10:52,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:10:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:10:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:10:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:10:52,321 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:10:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:52,377 INFO L93 Difference]: Finished difference Result 133 states and 240 transitions. [2024-10-24 05:10:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:10:52,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 158 [2024-10-24 05:10:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:52,390 INFO L225 Difference]: With dead ends: 133 [2024-10-24 05:10:52,391 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 05:10:52,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 05:10:52,400 INFO L432 NwaCegarLoop]: 100 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, 100 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 05:10:52,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:10:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 05:10:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 05:10:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:10:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-10-24 05:10:52,458 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 158 [2024-10-24 05:10:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:52,459 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-10-24 05:10:52,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 05:10:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-10-24 05:10:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 05:10:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:52,465 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:10:52,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -390898174, now seen corresponding path program 1 times [2024-10-24 05:10:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:10:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451414763] [2024-10-24 05:10:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:10:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:10:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:10:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:10:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:10:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:10:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:10:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:10:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:10:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:10:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:10:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:10:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:10:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:10:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:10:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:10:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:10:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:10:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:10:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:10:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:10:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:10:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:10:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:10:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:10:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:10:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:10:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:10:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:10:55,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451414763] [2024-10-24 05:10:55,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451414763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:10:55,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:10:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:10:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810220777] [2024-10-24 05:10:55,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:10:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:10:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:10:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:10:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:10:55,764 INFO L87 Difference]: Start difference. First operand 66 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:56,230 INFO L93 Difference]: Finished difference Result 235 states and 366 transitions. [2024-10-24 05:10:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:10:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 158 [2024-10-24 05:10:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:56,237 INFO L225 Difference]: With dead ends: 235 [2024-10-24 05:10:56,237 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 05:10:56,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:10:56,242 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 121 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:10:56,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 436 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:10:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 05:10:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 70. [2024-10-24 05:10:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:10:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2024-10-24 05:10:56,270 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 158 [2024-10-24 05:10:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:56,273 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2024-10-24 05:10:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2024-10-24 05:10:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 05:10:56,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:56,277 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:10:56,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 41426178, now seen corresponding path program 1 times [2024-10-24 05:10:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:10:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625641704] [2024-10-24 05:10:56,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:10:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:10:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:10:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:10:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:10:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:10:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:10:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:10:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:10:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:10:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:10:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:10:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:10:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:10:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:10:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:10:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:10:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:10:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:10:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:10:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:10:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:10:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:10:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:10:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:10:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:10:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:10:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:10:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:10:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625641704] [2024-10-24 05:10:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625641704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:10:56,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:10:56,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:10:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255328580] [2024-10-24 05:10:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:10:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:10:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:10:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:10:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:10:56,571 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:56,794 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2024-10-24 05:10:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:10:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 158 [2024-10-24 05:10:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:56,797 INFO L225 Difference]: With dead ends: 208 [2024-10-24 05:10:56,797 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 05:10:56,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:10:56,799 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 114 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:10:56,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 463 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:10:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 05:10:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 70. [2024-10-24 05:10:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:10:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2024-10-24 05:10:56,817 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 158 [2024-10-24 05:10:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2024-10-24 05:10:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2024-10-24 05:10:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 05:10:56,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:56,822 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:10:56,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1816433540, now seen corresponding path program 1 times [2024-10-24 05:10:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:10:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114576539] [2024-10-24 05:10:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:10:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:10:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:10:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:10:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:10:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:10:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:10:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:10:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:10:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:10:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:10:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:10:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:10:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:10:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:10:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:10:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:10:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:10:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:10:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:10:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:10:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:10:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:10:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:10:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:10:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:10:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:10:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 05:10:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:10:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114576539] [2024-10-24 05:10:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114576539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:10:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:10:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:10:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736769954] [2024-10-24 05:10:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:10:57,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:10:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:10:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:10:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:10:57,085 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:57,262 INFO L93 Difference]: Finished difference Result 208 states and 318 transitions. [2024-10-24 05:10:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:10:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 158 [2024-10-24 05:10:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:57,265 INFO L225 Difference]: With dead ends: 208 [2024-10-24 05:10:57,265 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 05:10:57,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:10:57,270 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 104 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:10:57,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 507 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:10:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 05:10:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 66. [2024-10-24 05:10:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:10:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-24 05:10:57,284 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 158 [2024-10-24 05:10:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:57,284 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-24 05:10:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 05:10:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-24 05:10:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 05:10:57,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:57,287 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:10:57,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:57,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1930685543, now seen corresponding path program 1 times [2024-10-24 05:10:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:10:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573333959] [2024-10-24 05:10:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:10:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat