./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_codestructure_steplocals_file-16.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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:09:34,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:09:34,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:09:34,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:09:34,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:09:34,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:09:34,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:09:34,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:09:34,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:09:34,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:09:34,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:09:34,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:09:34,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:09:34,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:09:34,536 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:09:34,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:09:34,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:09:34,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:09:34,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:09:34,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:09:34,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:09:34,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:09:34,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2025-03-08 10:09:34,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:09:34,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:09:34,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:09:34,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:09:34,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:09:34,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:35,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbb970ef/7e2a8fd9a2324050a9caac9f919f7f83/FLAGe4a4640ae [2025-03-08 10:09:36,112 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:09:36,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:36,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbb970ef/7e2a8fd9a2324050a9caac9f919f7f83/FLAGe4a4640ae [2025-03-08 10:09:36,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbb970ef/7e2a8fd9a2324050a9caac9f919f7f83 [2025-03-08 10:09:36,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:09:36,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:09:36,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:09:36,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:09:36,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:09:36,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36, skipping insertion in model container [2025-03-08 10:09:36,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:09:36,586 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_codestructure_steplocals_file-16.i[917,930] [2025-03-08 10:09:36,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:09:36,651 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:09:36,659 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_codestructure_steplocals_file-16.i[917,930] [2025-03-08 10:09:36,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:09:36,691 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:09:36,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36 WrapperNode [2025-03-08 10:09:36,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:09:36,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:09:36,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:09:36,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:09:36,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,723 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-03-08 10:09:36,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:09:36,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:09:36,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:09:36,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:09:36,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,747 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]. [2025-03-08 10:09:36,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:09:36,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:09:36,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:09:36,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:09:36,760 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (1/1) ... [2025-03-08 10:09:36,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:09:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:09:36,784 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) [2025-03-08 10:09:36,789 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 [2025-03-08 10:09:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:09:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:09:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:09:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:09:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:09:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:09:36,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:09:36,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:09:37,107 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-08 10:09:37,134 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 10:09:37,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:09:37,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:09:37,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:09:37,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:09:37 BoogieIcfgContainer [2025-03-08 10:09:37,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:09:37,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:09:37,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:09:37,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:09:37,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:09:36" (1/3) ... [2025-03-08 10:09:37,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e78eda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:09:37, skipping insertion in model container [2025-03-08 10:09:37,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:36" (2/3) ... [2025-03-08 10:09:37,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e78eda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:09:37, skipping insertion in model container [2025-03-08 10:09:37,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:09:37" (3/3) ... [2025-03-08 10:09:37,164 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:37,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:09:37,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-16.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:09:37,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:09:37,234 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;@7e172ece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:09:37,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:09:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 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) [2025-03-08 10:09:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:09:37,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:37,249 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, 1, 1, 1, 1] [2025-03-08 10:09:37,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:37,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash 988892353, now seen corresponding path program 1 times [2025-03-08 10:09:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866795129] [2025-03-08 10:09:37,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:37,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:37,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:37,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 10:09:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866795129] [2025-03-08 10:09:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866795129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:09:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830919101] [2025-03-08 10:09:37,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:09:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:09:37,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:09:37,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:09:37,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:37,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:37,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:37,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:09:37,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:09:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 10:09:37,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:09:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830919101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:09:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:09:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528882633] [2025-03-08 10:09:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:09:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:37,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:09:37,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:09:37,708 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:09:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:37,728 INFO L93 Difference]: Finished difference Result 160 states and 273 transitions. [2025-03-08 10:09:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:09:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 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 169 [2025-03-08 10:09:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:37,736 INFO L225 Difference]: With dead ends: 160 [2025-03-08 10:09:37,736 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 10:09:37,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:09:37,743 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:37,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:09:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 10:09:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 10:09:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 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) [2025-03-08 10:09:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 10:09:37,773 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 169 [2025-03-08 10:09:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:37,774 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 10:09:37,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:09:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 10:09:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:09:37,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:37,776 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, 1, 1, 1, 1] [2025-03-08 10:09:37,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:09:37,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:09:37,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 418540645, now seen corresponding path program 1 times [2025-03-08 10:09:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029797293] [2025-03-08 10:09:37,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:38,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:38,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:38,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:38,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029797293] [2025-03-08 10:09:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029797293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:40,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:09:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319057213] [2025-03-08 10:09:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:40,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:09:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:40,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:09:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:09:40,144 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2025-03-08 10:09:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:40,629 INFO L93 Difference]: Finished difference Result 242 states and 363 transitions. [2025-03-08 10:09:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:09:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 169 [2025-03-08 10:09:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:40,632 INFO L225 Difference]: With dead ends: 242 [2025-03-08 10:09:40,632 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 10:09:40,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:40,636 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:40,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 597 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:09:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 10:09:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2025-03-08 10:09:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 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) [2025-03-08 10:09:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 152 transitions. [2025-03-08 10:09:40,651 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 152 transitions. Word has length 169 [2025-03-08 10:09:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:40,652 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 152 transitions. [2025-03-08 10:09:40,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2025-03-08 10:09:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 152 transitions. [2025-03-08 10:09:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:09:40,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:40,655 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, 1, 1, 1, 1] [2025-03-08 10:09:40,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:09:40,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash -91993532, now seen corresponding path program 1 times [2025-03-08 10:09:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:40,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281394413] [2025-03-08 10:09:40,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:40,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:40,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:40,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:42,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281394413] [2025-03-08 10:09:42,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281394413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:42,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:42,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22419017] [2025-03-08 10:09:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:42,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:42,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:42,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:42,204 INFO L87 Difference]: Start difference. First operand 100 states and 152 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:42,672 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2025-03-08 10:09:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:09:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 169 [2025-03-08 10:09:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:42,674 INFO L225 Difference]: With dead ends: 262 [2025-03-08 10:09:42,674 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 10:09:42,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:42,675 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 138 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:42,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 625 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:09:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 10:09:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2025-03-08 10:09:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 87 states have internal predecessors, (124), 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) [2025-03-08 10:09:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2025-03-08 10:09:42,683 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 169 [2025-03-08 10:09:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:42,684 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2025-03-08 10:09:42,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2025-03-08 10:09:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:09:42,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:42,686 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, 1, 1, 1, 1] [2025-03-08 10:09:42,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:09:42,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:42,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1771850342, now seen corresponding path program 1 times [2025-03-08 10:09:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965947573] [2025-03-08 10:09:42,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965947573] [2025-03-08 10:09:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965947573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313522245] [2025-03-08 10:09:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:44,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:44,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:44,115 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:44,435 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2025-03-08 10:09:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:09:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 169 [2025-03-08 10:09:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:44,438 INFO L225 Difference]: With dead ends: 329 [2025-03-08 10:09:44,438 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 10:09:44,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:44,439 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 124 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:44,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 759 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:09:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 10:09:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 118. [2025-03-08 10:09:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 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) [2025-03-08 10:09:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2025-03-08 10:09:44,458 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 169 [2025-03-08 10:09:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:44,459 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2025-03-08 10:09:44,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2025-03-08 10:09:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:09:44,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:44,461 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, 1, 1, 1, 1] [2025-03-08 10:09:44,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:09:44,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:44,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1261316165, now seen corresponding path program 1 times [2025-03-08 10:09:44,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557103819] [2025-03-08 10:09:44,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:44,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:09:44,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:09:44,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:44,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557103819] [2025-03-08 10:09:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557103819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522355920] [2025-03-08 10:09:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:44,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:44,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:44,958 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:45,310 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2025-03-08 10:09:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:09:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 169 [2025-03-08 10:09:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:45,312 INFO L225 Difference]: With dead ends: 332 [2025-03-08 10:09:45,312 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 10:09:45,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:45,314 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 104 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:45,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1086 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:09:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 10:09:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 117. [2025-03-08 10:09:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 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) [2025-03-08 10:09:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2025-03-08 10:09:45,323 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 169 [2025-03-08 10:09:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2025-03-08 10:09:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-03-08 10:09:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2025-03-08 10:09:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:45,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:45,325 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:45,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:09:45,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1674174671, now seen corresponding path program 1 times [2025-03-08 10:09:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037410560] [2025-03-08 10:09:45,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:45,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:45,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:45,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:45,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037410560] [2025-03-08 10:09:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037410560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277292114] [2025-03-08 10:09:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:46,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:46,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:46,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:46,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:46,076 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:46,470 INFO L93 Difference]: Finished difference Result 359 states and 542 transitions. [2025-03-08 10:09:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:09:46,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:46,473 INFO L225 Difference]: With dead ends: 359 [2025-03-08 10:09:46,473 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 10:09:46,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:46,473 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 215 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:46,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 705 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:09:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 10:09:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 143. [2025-03-08 10:09:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 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) [2025-03-08 10:09:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2025-03-08 10:09:46,480 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 170 [2025-03-08 10:09:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:46,480 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2025-03-08 10:09:46,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2025-03-08 10:09:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:46,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:46,482 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:46,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:09:46,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:46,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1163640494, now seen corresponding path program 1 times [2025-03-08 10:09:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41243816] [2025-03-08 10:09:46,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:46,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:46,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:46,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:46,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:47,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41243816] [2025-03-08 10:09:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41243816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:09:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849383592] [2025-03-08 10:09:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:47,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:09:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:47,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:09:47,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:47,268 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2025-03-08 10:09:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:47,689 INFO L93 Difference]: Finished difference Result 385 states and 572 transitions. [2025-03-08 10:09:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:09:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:47,693 INFO L225 Difference]: With dead ends: 385 [2025-03-08 10:09:47,693 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 10:09:47,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:09:47,694 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 240 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:47,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 841 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:09:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 10:09:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2025-03-08 10:09:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 127 states have internal predecessors, (184), 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) [2025-03-08 10:09:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2025-03-08 10:09:47,701 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 170 [2025-03-08 10:09:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:47,701 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2025-03-08 10:09:47,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2025-03-08 10:09:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2025-03-08 10:09:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:47,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:47,703 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:47,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:09:47,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1267482928, now seen corresponding path program 1 times [2025-03-08 10:09:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158064850] [2025-03-08 10:09:47,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:47,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:47,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:47,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:47,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:48,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158064850] [2025-03-08 10:09:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158064850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:48,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:48,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:09:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683487831] [2025-03-08 10:09:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:09:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:48,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:09:48,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:48,249 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2025-03-08 10:09:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:48,645 INFO L93 Difference]: Finished difference Result 414 states and 616 transitions. [2025-03-08 10:09:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:09:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:48,648 INFO L225 Difference]: With dead ends: 414 [2025-03-08 10:09:48,649 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 10:09:48,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:09:48,650 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 191 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:48,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 887 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:09:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 10:09:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 155. [2025-03-08 10:09:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 127 states have internal predecessors, (184), 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) [2025-03-08 10:09:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2025-03-08 10:09:48,660 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 170 [2025-03-08 10:09:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2025-03-08 10:09:48,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2025-03-08 10:09:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2025-03-08 10:09:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:48,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:48,662 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:48,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:09:48,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1778017105, now seen corresponding path program 1 times [2025-03-08 10:09:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882120729] [2025-03-08 10:09:48,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:48,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:48,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:48,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:48,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882120729] [2025-03-08 10:09:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882120729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693598409] [2025-03-08 10:09:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:49,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:49,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:49,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:49,211 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:49,588 INFO L93 Difference]: Finished difference Result 414 states and 613 transitions. [2025-03-08 10:09:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:09:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:49,590 INFO L225 Difference]: With dead ends: 414 [2025-03-08 10:09:49,590 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 10:09:49,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:09:49,591 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 175 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:49,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 819 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:09:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 10:09:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 142. [2025-03-08 10:09:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 114 states have internal predecessors, (164), 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) [2025-03-08 10:09:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 216 transitions. [2025-03-08 10:09:49,597 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 216 transitions. Word has length 170 [2025-03-08 10:09:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:49,597 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 216 transitions. [2025-03-08 10:09:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 216 transitions. [2025-03-08 10:09:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:49,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:49,598 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:09:49,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2111954799, now seen corresponding path program 1 times [2025-03-08 10:09:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639988571] [2025-03-08 10:09:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:49,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639988571] [2025-03-08 10:09:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639988571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:09:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861451680] [2025-03-08 10:09:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:09:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:09:49,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:09:49,650 INFO L87 Difference]: Start difference. First operand 142 states and 216 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2025-03-08 10:09:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:49,679 INFO L93 Difference]: Finished difference Result 336 states and 508 transitions. [2025-03-08 10:09:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:09:49,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:49,681 INFO L225 Difference]: With dead ends: 336 [2025-03-08 10:09:49,681 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 10:09:49,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:09:49,681 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:49,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:09:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 10:09:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-08 10:09:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 162 states have internal predecessors, (227), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 10:09:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2025-03-08 10:09:49,689 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 170 [2025-03-08 10:09:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:49,690 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2025-03-08 10:09:49,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2025-03-08 10:09:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2025-03-08 10:09:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:49,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:49,691 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:49,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:09:49,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:49,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1224451118, now seen corresponding path program 1 times [2025-03-08 10:09:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674736119] [2025-03-08 10:09:49,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:49,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:49,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:49,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:49,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674736119] [2025-03-08 10:09:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674736119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:50,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:50,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:09:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122390442] [2025-03-08 10:09:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:50,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:09:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:50,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:09:50,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:09:50,325 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:51,080 INFO L93 Difference]: Finished difference Result 483 states and 698 transitions. [2025-03-08 10:09:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:09:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:51,084 INFO L225 Difference]: With dead ends: 483 [2025-03-08 10:09:51,084 INFO L226 Difference]: Without dead ends: 292 [2025-03-08 10:09:51,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:09:51,086 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 158 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:51,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1092 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:09:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-08 10:09:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 225. [2025-03-08 10:09:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 191 states have internal predecessors, (263), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:09:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-03-08 10:09:51,097 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 170 [2025-03-08 10:09:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:51,099 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-03-08 10:09:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2025-03-08 10:09:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-03-08 10:09:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:09:51,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:51,100 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, 1, 1, 1, 1, 1] [2025-03-08 10:09:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:09:51,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1734985295, now seen corresponding path program 1 times [2025-03-08 10:09:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31573049] [2025-03-08 10:09:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:09:51,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:09:51,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:51,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:09:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:09:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31573049] [2025-03-08 10:09:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31573049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:51,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:51,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:09:51,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147735120] [2025-03-08 10:09:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:09:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:09:51,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:09:51,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:09:51,354 INFO L87 Difference]: Start difference. First operand 225 states and 327 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2025-03-08 10:09:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:51,545 INFO L93 Difference]: Finished difference Result 469 states and 678 transitions. [2025-03-08 10:09:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:09:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 170 [2025-03-08 10:09:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:51,547 INFO L225 Difference]: With dead ends: 469 [2025-03-08 10:09:51,547 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 10:09:51,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:09:51,548 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 39 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:51,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 420 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:09:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 10:09:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2025-03-08 10:09:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 176 states have internal predecessors, (240), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:09:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 304 transitions. [2025-03-08 10:09:51,561 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 304 transitions. Word has length 170 [2025-03-08 10:09:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 304 transitions. [2025-03-08 10:09:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2025-03-08 10:09:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 304 transitions. [2025-03-08 10:09:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 10:09:51,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:51,562 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, 1, 1, 1, 1, 1, 1] [2025-03-08 10:09:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:09:51,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:51,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1959202083, now seen corresponding path program 1 times [2025-03-08 10:09:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:09:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784297329] [2025-03-08 10:09:51,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:09:51,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:09:51,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:09:51,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:51,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:09:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092078286] [2025-03-08 10:09:51,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:09:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:09:51,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:09:51,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:09:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:09:51,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:09:51,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:09:51,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:09:51,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:09:51,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:09:51,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:51,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:09:51,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:09:51,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:09:51,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:09:51,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:09:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 10:09:52,037 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:09:52,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:09:52,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:09:52 BoogieIcfgContainer [2025-03-08 10:09:52,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:09:52,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:09:52,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:09:52,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:09:52,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:09:37" (3/4) ... [2025-03-08 10:09:52,137 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:09:52,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:09:52,138 INFO L158 Benchmark]: Toolchain (without parser) took 15655.82ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 111.4MB in the beginning and 375.1MB in the end (delta: -263.7MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. [2025-03-08 10:09:52,139 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:09:52,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:09:52,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:09:52,140 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:09:52,140 INFO L158 Benchmark]: IcfgBuilder took 393.98ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 68.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:09:52,140 INFO L158 Benchmark]: TraceAbstraction took 14979.98ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 67.6MB in the beginning and 375.3MB in the end (delta: -307.7MB). Peak memory consumption was 255.8MB. Max. memory is 16.1GB. [2025-03-08 10:09:52,140 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 704.6MB. Free memory was 375.3MB in the beginning and 375.1MB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:09:52,141 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 393.98ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 68.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14979.98ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 67.6MB in the beginning and 375.3MB in the end (delta: -307.7MB). Peak memory consumption was 255.8MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 704.6MB. Free memory was 375.3MB in the beginning and 375.1MB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] signed short int var_1_2 = 10000; [L24] signed long int var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 64; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 256; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 1441729073; [L32] unsigned short int var_1_11 = 32; [L33] double var_1_12 = 7.6; [L34] double var_1_13 = 127.8; [L35] signed char var_1_14 = 32; [L36] signed char var_1_15 = 50; [L37] signed char var_1_16 = 0; [L38] signed char var_1_17 = 16; [L39] float var_1_18 = 0.4; [L40] unsigned char var_1_19 = 0; [L41] float var_1_20 = 24.4; [L42] float var_1_21 = 500.5; [L43] float var_1_22 = 99.324; [L44] unsigned short int var_1_23 = 128; VAL [isInitial=0, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=10000, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] var_1_3 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] var_1_4 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L103] var_1_5 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L106] var_1_6 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L108] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=256, var_1_9=2] [L109] var_1_8 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_9=2] [L110] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L111] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L112] var_1_10 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L113] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L114] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L115] var_1_13 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L116] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L117] var_1_15 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L118] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L119] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L120] var_1_16 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L122] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L123] var_1_17 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L124] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L125] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L125] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L128] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L128] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L129] var_1_20 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L130] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L131] var_1_21 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L132] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L133] var_1_22 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L134] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L49] COND FALSE !((var_1_2 / -50) >= stepLocal_0) [L56] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L58] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=130, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=8, var_1_8=262146, var_1_9=2] [L59] COND TRUE var_1_2 < stepLocal_1 [L60] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=2] [L62] COND TRUE var_1_6 > 128 [L63] var_1_9 = (var_1_8 - (var_1_10 - var_1_7)) VAL [isInitial=1, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L65] signed long int stepLocal_2 = (var_1_7 + var_1_9) * var_1_3; VAL [isInitial=1, stepLocal_2=1073741558, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, stepLocal_2=1073741558, var_1_10=1073741824, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L66] COND FALSE !(stepLocal_2 < (var_1_5 | var_1_6)) [L71] var_1_11 = var_1_8 VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L73] signed short int stepLocal_4 = var_1_2; [L74] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, stepLocal_3=262146, stepLocal_4=102, var_1_10=1073741824, var_1_11=262146, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L75] COND FALSE !(stepLocal_3 < (- var_1_10)) [L80] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_4=102, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L82] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, stepLocal_4=102, stepLocal_5=262146, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L83] COND TRUE var_1_1 <= stepLocal_5 [L84] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, stepLocal_4=102, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L86] COND TRUE var_1_4 || var_1_19 [L87] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, stepLocal_4=102, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L89] COND TRUE var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5) [L90] var_1_23 = var_1_6 VAL [isInitial=1, stepLocal_4=102, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L139-L140] return (((((((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_11 < (- var_1_10)) ? ((var_1_8 <= var_1_2) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((var_1_1 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741824, var_1_11=262146, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=130, var_1_2=102, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=130, var_1_7=132, var_1_8=262146, var_1_9=-1073741690] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 152 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1552 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1552 mSDsluCounter, 8195 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6603 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4783 IncrementalHoareTripleChecker+Invalid, 4806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1592 mSDtfsCounter, 4783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=11, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 840 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 2546 NumberOfCodeBlocks, 2546 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2191 ConstructedInterpolants, 0 QuantifiedInterpolants, 11965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 16850/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:09:52,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_codestructure_steplocals_file-16.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:09:53,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:09:54,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:09:54,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:09:54,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:09:54,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:09:54,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:09:54,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:09:54,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:09:54,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:09:54,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:09:54,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:09:54,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:09:54,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:09:54,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:09:54,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:09:54,115 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:09:54,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:09:54,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:09:54,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:09:54,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:09:54,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:09:54,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:09:54,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2025-03-08 10:09:54,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:09:54,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:09:54,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:09:54,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:09:54,369 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:09:54,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:55,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad42cbfab/71fafee6d85a4ed5aca7ca30312b1750/FLAG157ca2879 [2025-03-08 10:09:55,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:09:55,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:55,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad42cbfab/71fafee6d85a4ed5aca7ca30312b1750/FLAG157ca2879 [2025-03-08 10:09:56,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad42cbfab/71fafee6d85a4ed5aca7ca30312b1750 [2025-03-08 10:09:56,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:09:56,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:09:56,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:09:56,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:09:56,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:09:56,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56, skipping insertion in model container [2025-03-08 10:09:56,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:09:56,255 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_codestructure_steplocals_file-16.i[917,930] [2025-03-08 10:09:56,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:09:56,307 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:09:56,315 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_codestructure_steplocals_file-16.i[917,930] [2025-03-08 10:09:56,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:09:56,346 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:09:56,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56 WrapperNode [2025-03-08 10:09:56,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:09:56,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:09:56,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:09:56,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:09:56,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,379 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-03-08 10:09:56,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:09:56,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:09:56,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:09:56,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:09:56,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,415 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]. [2025-03-08 10:09:56,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:09:56,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:09:56,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:09:56,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:09:56,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (1/1) ... [2025-03-08 10:09:56,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:09:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:09:56,468 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) [2025-03-08 10:09:56,471 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 [2025-03-08 10:09:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:09:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:09:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:09:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:09:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:09:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:09:56,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:09:56,543 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:09:58,052 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:09:58,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:09:58,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:09:58,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:09:58,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:09:58 BoogieIcfgContainer [2025-03-08 10:09:58,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:09:58,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:09:58,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:09:58,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:09:58,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:09:56" (1/3) ... [2025-03-08 10:09:58,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434cd4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:09:58, skipping insertion in model container [2025-03-08 10:09:58,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:09:56" (2/3) ... [2025-03-08 10:09:58,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434cd4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:09:58, skipping insertion in model container [2025-03-08 10:09:58,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:09:58" (3/3) ... [2025-03-08 10:09:58,092 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2025-03-08 10:09:58,100 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:09:58,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-16.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:09:58,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:09:58,145 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;@1fdefc6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:09:58,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:09:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 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) [2025-03-08 10:09:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:09:58,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:58,157 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, 1] [2025-03-08 10:09:58,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash -578873228, now seen corresponding path program 1 times [2025-03-08 10:09:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:09:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583469270] [2025-03-08 10:09:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:09:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:09:58,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:09:58,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:09:58,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:09:58,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:09:58,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:58,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:58,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:09:58,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:09:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 10:09:58,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:09:58,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:09:58,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583469270] [2025-03-08 10:09:58,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583469270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:09:58,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:09:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:09:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102812489] [2025-03-08 10:09:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:09:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:09:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:09:58,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:09:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:09:58,524 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:09:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:58,541 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2025-03-08 10:09:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:09:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-03-08 10:09:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:58,548 INFO L225 Difference]: With dead ends: 142 [2025-03-08 10:09:58,548 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 10:09:58,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:09:58,554 INFO L435 NwaCegarLoop]: 107 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, 107 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 [2025-03-08 10:09:58,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:09:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 10:09:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 10:09:58,580 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) [2025-03-08 10:09:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2025-03-08 10:09:58,587 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 166 [2025-03-08 10:09:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2025-03-08 10:09:58,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:09:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2025-03-08 10:09:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:09:58,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:58,589 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, 1] [2025-03-08 10:09:58,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:09:58,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:09:58,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:58,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1948695376, now seen corresponding path program 1 times [2025-03-08 10:09:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:09:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673094407] [2025-03-08 10:09:58,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:09:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:09:58,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:09:58,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:09:58,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:09:59,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:09:59,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:59,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:59,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 10:09:59,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:10:42,464 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)