./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 47cd392676bec39dae7770de53e22dff9d81be51a0efae6a4b87035607bdf0b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:50:17,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:50:17,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:50:17,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:50:17,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:50:17,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:50:17,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:50:17,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:50:17,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:50:17,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:50:17,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:50:17,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:50:17,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:50:17,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:50:17,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:50:17,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:50:17,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:50:17,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:50:17,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:50:17,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:50:17,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:50:17,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:50:17,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:50:17,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:50:17,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:50:17,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:50:17,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:50:17,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:50:17,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:50:17,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:50:17,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:50:17,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:50:17,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:17,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:50:17,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:50:17,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:50:17,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:50:17,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:50:17,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:50:17,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:50:17,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:50:17,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:50:17,726 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 -> 47cd392676bec39dae7770de53e22dff9d81be51a0efae6a4b87035607bdf0b5 [2024-11-12 06:50:17,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:50:18,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:50:18,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:50:18,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:50:18,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:50:18,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i [2024-11-12 06:50:19,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:50:19,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:50:19,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i [2024-11-12 06:50:19,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620d835fc/15abcc8080a244098bb607a21d4c9514/FLAGfcd47a463 [2024-11-12 06:50:19,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620d835fc/15abcc8080a244098bb607a21d4c9514 [2024-11-12 06:50:19,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:50:19,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:50:19,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:19,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:50:19,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:50:19,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d052d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19, skipping insertion in model container [2024-11-12 06:50:19,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:50:19,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i[915,928] [2024-11-12 06:50:20,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:20,062 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:50:20,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i[915,928] [2024-11-12 06:50:20,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:20,114 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:50:20,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20 WrapperNode [2024-11-12 06:50:20,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:20,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:20,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:50:20,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:50:20,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,163 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-12 06:50:20,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:20,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:50:20,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:50:20,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:50:20,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,210 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:50:20,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:50:20,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:50:20,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:50:20,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:50:20,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (1/1) ... [2024-11-12 06:50:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:50:20,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:50:20,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:50:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:50:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:50:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:50:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:50:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:50:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:50:20,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:50:20,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:50:20,775 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 06:50:20,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:50:20,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:50:20,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:50:20,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:20 BoogieIcfgContainer [2024-11-12 06:50:20,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:50:20,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:50:20,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:50:20,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:50:20,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:50:19" (1/3) ... [2024-11-12 06:50:20,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dee385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:20, skipping insertion in model container [2024-11-12 06:50:20,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:20" (2/3) ... [2024-11-12 06:50:20,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dee385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:20, skipping insertion in model container [2024-11-12 06:50:20,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:20" (3/3) ... [2024-11-12 06:50:20,803 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-64.i [2024-11-12 06:50:20,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:50:20,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:50:20,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:50:20,904 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;@5f9dfebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:50:20,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:50:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 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-11-12 06:50:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 06:50:20,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:20,921 INFO L218 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, 1, 1, 1] [2024-11-12 06:50:20,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1472419692, now seen corresponding path program 1 times [2024-11-12 06:50:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716189699] [2024-11-12 06:50:20,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:50:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:50:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:50:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:50:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:50:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:50:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 06:50:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:50:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:50:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 06:50:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:50:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716189699] [2024-11-12 06:50:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716189699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:21,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:50:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003859100] [2024-11-12 06:50:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:50:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:50:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:21,528 INFO L87 Difference]: Start difference. First operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 06:50:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:21,558 INFO L93 Difference]: Finished difference Result 143 states and 250 transitions. [2024-11-12 06:50:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:50:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 163 [2024-11-12 06:50:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:21,570 INFO L225 Difference]: With dead ends: 143 [2024-11-12 06:50:21,570 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 06:50:21,574 INFO L434 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-11-12 06:50:21,579 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:21,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:50:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 06:50:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 06:50:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 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-11-12 06:50:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-11-12 06:50:21,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 163 [2024-11-12 06:50:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-11-12 06:50:21,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 06:50:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-11-12 06:50:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 06:50:21,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:21,652 INFO L218 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, 1, 1, 1] [2024-11-12 06:50:21,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:50:21,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:21,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:21,653 INFO L85 PathProgramCache]: Analyzing trace with hash -688375340, now seen corresponding path program 1 times [2024-11-12 06:50:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:21,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307404417] [2024-11-12 06:50:21,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:21,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:50:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:50:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:50:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:50:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:50:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:50:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 06:50:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:50:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:50:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 06:50:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:50:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307404417] [2024-11-12 06:50:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307404417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:50:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867709504] [2024-11-12 06:50:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:50:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:50:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:50:25,093 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:50:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:25,577 INFO L93 Difference]: Finished difference Result 247 states and 378 transitions. [2024-11-12 06:50:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:50:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 163 [2024-11-12 06:50:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:25,582 INFO L225 Difference]: With dead ends: 247 [2024-11-12 06:50:25,582 INFO L226 Difference]: Without dead ends: 179 [2024-11-12 06:50:25,583 INFO L434 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-11-12 06:50:25,584 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 128 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:25,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 464 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:50:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-12 06:50:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 75. [2024-11-12 06:50:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 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-11-12 06:50:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-12 06:50:25,610 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 163 [2024-11-12 06:50:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:25,614 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-12 06:50:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:50:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-12 06:50:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 06:50:25,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:25,619 INFO L218 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, 1, 1, 1] [2024-11-12 06:50:25,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:50:25,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -171222316, now seen corresponding path program 1 times [2024-11-12 06:50:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106330544] [2024-11-12 06:50:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:50:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:50:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:50:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:50:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:50:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:50:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 06:50:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:50:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:50:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 06:50:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:50:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106330544] [2024-11-12 06:50:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106330544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:50:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118486343] [2024-11-12 06:50:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:50:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:50:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:50:27,967 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:50:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:28,220 INFO L93 Difference]: Finished difference Result 206 states and 313 transitions. [2024-11-12 06:50:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:50:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 163 [2024-11-12 06:50:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:28,224 INFO L225 Difference]: With dead ends: 206 [2024-11-12 06:50:28,224 INFO L226 Difference]: Without dead ends: 134 [2024-11-12 06:50:28,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:50:28,230 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 109 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:28,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 567 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:50:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-12 06:50:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2024-11-12 06:50:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 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-11-12 06:50:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-12 06:50:28,251 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 163 [2024-11-12 06:50:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:28,252 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-12 06:50:28,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-12 06:50:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-12 06:50:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 06:50:28,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:28,257 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:50:28,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:50:28,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -652193233, now seen corresponding path program 1 times [2024-11-12 06:50:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96465746] [2024-11-12 06:50:28,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:50:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:50:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:50:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:50:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:50:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:50:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 06:50:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:50:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:50:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 06:50:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 06:50:32,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96465746] [2024-11-12 06:50:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96465746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:50:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893992644] [2024-11-12 06:50:32,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:32,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:50:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:50:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:50:32,512 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-11-12 06:50:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:33,399 INFO L93 Difference]: Finished difference Result 315 states and 450 transitions. [2024-11-12 06:50:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:50:33,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 165 [2024-11-12 06:50:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:33,403 INFO L225 Difference]: With dead ends: 315 [2024-11-12 06:50:33,403 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 06:50:33,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:50:33,405 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 311 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:33,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 335 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 06:50:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 06:50:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 171. [2024-11-12 06:50:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 123 states have internal predecessors, (161), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 06:50:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2024-11-12 06:50:33,448 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 165 [2024-11-12 06:50:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:33,449 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2024-11-12 06:50:33,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-11-12 06:50:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2024-11-12 06:50:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 06:50:33,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:33,452 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:50:33,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:50:33,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1045220243, now seen corresponding path program 1 times [2024-11-12 06:50:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790582353] [2024-11-12 06:50:33,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat