./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercode_fillercodestructure_filler-ps-ci_file-27.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 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:36:25,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:36:25,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:36:25,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:36:25,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:36:25,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:36:25,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:36:25,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:36:25,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:36:25,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:36:25,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:36:25,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:36:25,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:36:25,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:36:25,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:36:25,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:36:25,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:36:25,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:25,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:36:25,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:36:25,575 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 -> 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 [2025-03-03 21:36:25,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:36:25,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:36:25,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:36:25,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:36:25,816 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:36:25,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:26,957 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8c909dc/d8914c74c9344a9fa80e39c110b52de6/FLAG2e4217f7b [2025-03-03 21:36:27,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:36:27,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:27,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8c909dc/d8914c74c9344a9fa80e39c110b52de6/FLAG2e4217f7b [2025-03-03 21:36:27,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8c909dc/d8914c74c9344a9fa80e39c110b52de6 [2025-03-03 21:36:27,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:36:27,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:36:27,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:27,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:36:27,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:36:27,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c123963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27, skipping insertion in model container [2025-03-03 21:36:27,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:36:27,402 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2025-03-03 21:36:27,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:27,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:36:27,464 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2025-03-03 21:36:27,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:27,497 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:36:27,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27 WrapperNode [2025-03-03 21:36:27,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:27,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:27,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:36:27,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:36:27,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,535 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-03-03 21:36:27,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:27,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:36:27,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:36:27,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:36:27,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,560 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-03 21:36:27,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:36:27,576 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:36:27,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:36:27,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:36:27,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (1/1) ... [2025-03-03 21:36:27,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:27,605 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-03 21:36:27,607 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-03 21:36:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:36:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:36:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:36:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:36:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:36:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:36:27,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:36:27,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:36:28,013 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2025-03-03 21:36:28,043 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:36:28,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:36:28,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:36:28,059 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 21:36:28,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:28 BoogieIcfgContainer [2025-03-03 21:36:28,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:36:28,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:36:28,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:36:28,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:36:28,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:36:27" (1/3) ... [2025-03-03 21:36:28,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be4ddaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:28, skipping insertion in model container [2025-03-03 21:36:28,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:27" (2/3) ... [2025-03-03 21:36:28,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be4ddaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:28, skipping insertion in model container [2025-03-03 21:36:28,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:28" (3/3) ... [2025-03-03 21:36:28,067 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:28,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:36:28,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:36:28,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:36:28,124 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;@39b83d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:36:28,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:36:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 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-03 21:36:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:36:28,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:28,136 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, 1] [2025-03-03 21:36:28,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:28,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1012434500, now seen corresponding path program 1 times [2025-03-03 21:36:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567476294] [2025-03-03 21:36:28,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:28,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:36:28,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:36:28,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:28,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:28,445 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-03 21:36:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:28,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567476294] [2025-03-03 21:36:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567476294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:28,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117192044] [2025-03-03 21:36:28,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:28,450 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-03 21:36:28,451 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-03 21:36:28,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:36:28,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:36:28,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:36:28,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:28,621 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-03 21:36:28,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117192044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:36:28,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:36:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953299635] [2025-03-03 21:36:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:28,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:36:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:28,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:36:28,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:36:28,645 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03 21:36:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:28,668 INFO L93 Difference]: Finished difference Result 174 states and 301 transitions. [2025-03-03 21:36:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:36:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 172 [2025-03-03 21:36:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:28,673 INFO L225 Difference]: With dead ends: 174 [2025-03-03 21:36:28,673 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 21:36:28,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-03 21:36:28,677 INFO L435 NwaCegarLoop]: 131 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, 131 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-03 21:36:28,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 21:36:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 21:36:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 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-03 21:36:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-03-03 21:36:28,704 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 172 [2025-03-03 21:36:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:28,705 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-03-03 21:36:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03 21:36:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-03-03 21:36:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:36:28,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:28,707 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, 1] [2025-03-03 21:36:28,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:36:28,908 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-03 21:36:28,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:28,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 836807817, now seen corresponding path program 1 times [2025-03-03 21:36:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:28,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385306244] [2025-03-03 21:36:28,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:28,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:36:28,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:36:29,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:29,363 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-03 21:36:29,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385306244] [2025-03-03 21:36:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385306244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:36:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195726291] [2025-03-03 21:36:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:36:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:29,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:36:29,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:36:29,369 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03 21:36:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:29,443 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2025-03-03 21:36:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 172 [2025-03-03 21:36:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:29,447 INFO L225 Difference]: With dead ends: 255 [2025-03-03 21:36:29,447 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 21:36:29,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:29,450 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 70 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:29,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 401 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 21:36:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2025-03-03 21:36:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:36:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-03-03 21:36:29,487 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 172 [2025-03-03 21:36:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:29,487 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-03-03 21:36:29,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03 21:36:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-03-03 21:36:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:36:29,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:29,491 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, 1, 1] [2025-03-03 21:36:29,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:36:29,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1068446723, now seen corresponding path program 1 times [2025-03-03 21:36:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:29,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034238895] [2025-03-03 21:36:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:29,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:36:29,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:36:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:30,012 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-03 21:36:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034238895] [2025-03-03 21:36:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034238895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:30,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:36:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586864456] [2025-03-03 21:36:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:30,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:36:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:30,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:36:30,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:30,020 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 21:36:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:30,271 INFO L93 Difference]: Finished difference Result 419 states and 634 transitions. [2025-03-03 21:36:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:36:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 173 [2025-03-03 21:36:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:30,275 INFO L225 Difference]: With dead ends: 419 [2025-03-03 21:36:30,277 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 21:36:30,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:30,279 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 95 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:30,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 507 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:36:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 21:36:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2025-03-03 21:36:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 178 states have (on average 1.348314606741573) internal successors, (240), 180 states have internal predecessors, (240), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:36:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 376 transitions. [2025-03-03 21:36:30,331 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 376 transitions. Word has length 173 [2025-03-03 21:36:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:30,333 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 376 transitions. [2025-03-03 21:36:30,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 21:36:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 376 transitions. [2025-03-03 21:36:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:36:30,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:30,336 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, 1, 1] [2025-03-03 21:36:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:36:30,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:30,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 557912546, now seen corresponding path program 1 times [2025-03-03 21:36:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71359354] [2025-03-03 21:36:30,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:30,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:36:30,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:36:30,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:30,574 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-03 21:36:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:30,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71359354] [2025-03-03 21:36:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71359354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:36:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284497394] [2025-03-03 21:36:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:30,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:36:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:30,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:36:30,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:36:30,579 INFO L87 Difference]: Start difference. First operand 251 states and 376 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03 21:36:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:30,844 INFO L93 Difference]: Finished difference Result 771 states and 1161 transitions. [2025-03-03 21:36:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 173 [2025-03-03 21:36:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:30,848 INFO L225 Difference]: With dead ends: 771 [2025-03-03 21:36:30,848 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 21:36:30,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:30,850 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 162 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:30,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 324 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:36:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 21:36:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 517. [2025-03-03 21:36:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 372 states have (on average 1.3655913978494623) internal successors, (508), 376 states have internal predecessors, (508), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 21:36:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 780 transitions. [2025-03-03 21:36:30,927 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 780 transitions. Word has length 173 [2025-03-03 21:36:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:30,929 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 780 transitions. [2025-03-03 21:36:30,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03 21:36:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 780 transitions. [2025-03-03 21:36:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:36:30,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:30,930 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, 1, 1, 1] [2025-03-03 21:36:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:36:30,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 804027918, now seen corresponding path program 1 times [2025-03-03 21:36:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250213263] [2025-03-03 21:36:30,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:30,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:30,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:30,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:31,164 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-03 21:36:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250213263] [2025-03-03 21:36:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250213263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:36:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548933021] [2025-03-03 21:36:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:31,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:36:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:31,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:36:31,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:31,167 INFO L87 Difference]: Start difference. First operand 517 states and 780 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:36:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:31,463 INFO L93 Difference]: Finished difference Result 1035 states and 1562 transitions. [2025-03-03 21:36:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-03 21:36:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:31,467 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 21:36:31,467 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 21:36:31,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:36:31,469 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 149 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:31,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 668 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:36:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 21:36:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2025-03-03 21:36:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 374 states have (on average 1.3636363636363635) internal successors, (510), 378 states have internal predecessors, (510), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 21:36:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 782 transitions. [2025-03-03 21:36:31,503 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 782 transitions. Word has length 174 [2025-03-03 21:36:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:31,503 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 782 transitions. [2025-03-03 21:36:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:36:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 782 transitions. [2025-03-03 21:36:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:36:31,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:31,505 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, 1, 1, 1] [2025-03-03 21:36:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:36:31,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 223484423, now seen corresponding path program 1 times [2025-03-03 21:36:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987870224] [2025-03-03 21:36:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:31,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:31,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:31,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:31,655 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-03 21:36:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987870224] [2025-03-03 21:36:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987870224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:36:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647084806] [2025-03-03 21:36:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:31,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:36:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:31,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:36:31,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:31,656 INFO L87 Difference]: Start difference. First operand 519 states and 782 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03 21:36:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:31,878 INFO L93 Difference]: Finished difference Result 859 states and 1280 transitions. [2025-03-03 21:36:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:36:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 174 [2025-03-03 21:36:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:31,884 INFO L225 Difference]: With dead ends: 859 [2025-03-03 21:36:31,884 INFO L226 Difference]: Without dead ends: 611 [2025-03-03 21:36:31,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:36:31,886 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 265 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:31,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 462 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:36:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-03 21:36:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 551. [2025-03-03 21:36:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 406 states have (on average 1.374384236453202) internal successors, (558), 410 states have internal predecessors, (558), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 21:36:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 830 transitions. [2025-03-03 21:36:31,925 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 830 transitions. Word has length 174 [2025-03-03 21:36:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:31,926 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 830 transitions. [2025-03-03 21:36:31,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03 21:36:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 830 transitions. [2025-03-03 21:36:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:36:31,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:31,927 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, 1, 1, 1] [2025-03-03 21:36:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:36:31,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:31,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1051143144, now seen corresponding path program 1 times [2025-03-03 21:36:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677950073] [2025-03-03 21:36:31,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:31,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:31,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:31,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:31,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:36:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677950073] [2025-03-03 21:36:32,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677950073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003977437] [2025-03-03 21:36:32,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:32,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:32,108 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-03 21:36:32,110 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-03 21:36:32,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:32,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:32,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:36:32,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 21:36:32,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:36:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003977437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:36:32,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:36:32,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 21:36:32,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409940151] [2025-03-03 21:36:32,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:36:32,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:36:32,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:32,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:36:32,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:32,480 INFO L87 Difference]: Start difference. First operand 551 states and 830 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 21:36:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:32,661 INFO L93 Difference]: Finished difference Result 1131 states and 1685 transitions. [2025-03-03 21:36:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:36:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 174 [2025-03-03 21:36:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:32,665 INFO L225 Difference]: With dead ends: 1131 [2025-03-03 21:36:32,665 INFO L226 Difference]: Without dead ends: 583 [2025-03-03 21:36:32,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:36:32,667 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 151 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:32,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 238 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:36:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-03 21:36:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 567. [2025-03-03 21:36:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 418 states have (on average 1.3492822966507176) internal successors, (564), 422 states have internal predecessors, (564), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 21:36:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 836 transitions. [2025-03-03 21:36:32,708 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 836 transitions. Word has length 174 [2025-03-03 21:36:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:32,709 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 836 transitions. [2025-03-03 21:36:32,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 21:36:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 836 transitions. [2025-03-03 21:36:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:36:32,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:32,711 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, 1, 1, 1] [2025-03-03 21:36:32,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:32,911 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,SelfDestructingSolverStorable6 [2025-03-03 21:36:32,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -564211319, now seen corresponding path program 1 times [2025-03-03 21:36:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266037523] [2025-03-03 21:36:32,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:32,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:32,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:32,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:32,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-03-03 21:36:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266037523] [2025-03-03 21:36:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266037523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975603946] [2025-03-03 21:36:33,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:33,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:36:33,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:36:33,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:33,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:33,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:33,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:33,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 21:36:33,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-03 21:36:34,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2025-03-03 21:36:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975603946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:36:34,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:36:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 21 [2025-03-03 21:36:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957321685] [2025-03-03 21:36:34,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:36:34,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 21:36:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:34,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 21:36:34,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:36:34,564 INFO L87 Difference]: Start difference. First operand 567 states and 836 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-03 21:36:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:35,661 INFO L93 Difference]: Finished difference Result 1283 states and 1838 transitions. [2025-03-03 21:36:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 21:36:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2025-03-03 21:36:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:35,669 INFO L225 Difference]: With dead ends: 1283 [2025-03-03 21:36:35,670 INFO L226 Difference]: Without dead ends: 995 [2025-03-03 21:36:35,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=629, Invalid=1723, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 21:36:35,672 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 481 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:35,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 553 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:36:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-03 21:36:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 784. [2025-03-03 21:36:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 571 states have (on average 1.3099824868651488) internal successors, (748), 577 states have internal predecessors, (748), 182 states have call successors, (182), 30 states have call predecessors, (182), 30 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-03 21:36:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1112 transitions. [2025-03-03 21:36:35,753 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1112 transitions. Word has length 174 [2025-03-03 21:36:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:35,753 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1112 transitions. [2025-03-03 21:36:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-03 21:36:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1112 transitions. [2025-03-03 21:36:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:36:35,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:35,757 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, 1, 1, 1] [2025-03-03 21:36:35,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:35,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash 878277894, now seen corresponding path program 1 times [2025-03-03 21:36:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269948784] [2025-03-03 21:36:35,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:36:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127119846] [2025-03-03 21:36:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:36,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:36:36,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:36:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:36:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:36:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:36,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 21:36:36,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 21:36:36,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269948784] [2025-03-03 21:36:36,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:36:36,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127119846] [2025-03-03 21:36:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127119846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:36,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:36:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 21:36:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114249667] [2025-03-03 21:36:36,846 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:36:36,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:36:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:36,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:36:36,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:36:36,847 INFO L87 Difference]: Start difference. First operand 784 states and 1112 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 21:36:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:37,409 INFO L93 Difference]: Finished difference Result 1659 states and 2302 transitions. [2025-03-03 21:36:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:36:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 174 [2025-03-03 21:36:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:37,416 INFO L225 Difference]: With dead ends: 1659 [2025-03-03 21:36:37,416 INFO L226 Difference]: Without dead ends: 899 [2025-03-03 21:36:37,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:36:37,420 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 406 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:37,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 493 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:36:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-03 21:36:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 810. [2025-03-03 21:36:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 589 states have (on average 1.2801358234295417) internal successors, (754), 595 states have internal predecessors, (754), 182 states have call successors, (182), 38 states have call predecessors, (182), 38 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-03 21:36:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1118 transitions. [2025-03-03 21:36:37,497 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1118 transitions. Word has length 174 [2025-03-03 21:36:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1118 transitions. [2025-03-03 21:36:37,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 21:36:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1118 transitions. [2025-03-03 21:36:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:36:37,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:37,500 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, 1, 1, 1, 1] [2025-03-03 21:36:37,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:37,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 464729783, now seen corresponding path program 1 times [2025-03-03 21:36:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284424717] [2025-03-03 21:36:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:37,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:36:37,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:36:37,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:37,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:36:37,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391082308] [2025-03-03 21:36:37,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:37,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:37,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:37,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:36:37,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:36:37,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:36:38,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:36:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:36:38,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:36:38,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:36:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:36:38,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:38,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:36:38,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:36:38,342 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:36:38,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:36:38,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 21:36:38,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:36:38,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:38,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:36:38,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:36:38 BoogieIcfgContainer [2025-03-03 21:36:38,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:36:38,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:36:38,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:36:38,637 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:36:38,637 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:28" (3/4) ... [2025-03-03 21:36:38,639 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:36:38,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:36:38,639 INFO L158 Benchmark]: Toolchain (without parser) took 11368.55ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.5MB in the beginning and 264.3MB in the end (delta: -158.9MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2025-03-03 21:36:38,639 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:38,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.75ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:36:38,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:38,640 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:36:38,640 INFO L158 Benchmark]: IcfgBuilder took 483.20ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 57.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:36:38,640 INFO L158 Benchmark]: TraceAbstraction took 10574.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 57.2MB in the beginning and 264.4MB in the end (delta: -207.3MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2025-03-03 21:36:38,641 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 394.3MB. Free memory was 264.4MB in the beginning and 264.3MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:38,641 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.75ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 483.20ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 57.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10574.88ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 57.2MB in the beginning and 264.4MB in the end (delta: -207.3MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 394.3MB. Free memory was 264.4MB in the beginning and 264.3MB in the end (delta: 120.0kB). 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 shiftRight at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L56] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L61] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L62] COND TRUE var_1_11 >= var_1_11 [L63] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L65] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L66] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=1, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L67] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L68] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L85] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L86] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=0, var_1_8=1] [L88] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L89] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L90] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L92] var_1_20 = var_1_11 [L93] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L94] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L94] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L101] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L112] unsigned char stepLocal_1 = var_1_14; [L113] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L114] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L115] COND TRUE stepLocal_1 || var_1_14 [L116] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=1] [L123] COND FALSE !(var_1_6 > (- var_1_7)) [L128] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=128, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=33] [L130] var_1_22 = var_1_8 VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=33, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=33] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=33, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=33] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=33, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=33] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=33, var_1_12=33, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=33, var_1_21=8, var_1_22=33, var_1_23=32, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=33, var_1_32=0, var_1_33=31, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=33, var_1_47=33, var_1_8=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1837 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1779 mSDsluCounter, 3777 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2464 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1914 IncrementalHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 1313 mSDtfsCounter, 1914 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1184 GetRequests, 1084 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 392 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 7691 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1583 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 17736/18200 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-03 21:36:38,666 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_fillercode_fillercodestructure_filler-ps-ci_file-27.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 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:36:40,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:36:40,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:36:40,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:36:40,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:36:40,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:36:40,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:36:40,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:36:40,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:36:40,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:36:40,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:36:40,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:36:40,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:36:40,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:40,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:36:40,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:36:40,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:36:40,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:36:40,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:36:40,572 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 -> 1ddb35e71f8e18cdd0992b52a315893b49188682f163cce9af036fd922ec6944 [2025-03-03 21:36:40,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:36:40,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:36:40,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:36:40,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:36:40,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:36:40,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:41,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8470222/5bae32065c8e4776b23c8992ff0f6c12/FLAG45be29aab [2025-03-03 21:36:42,206 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:36:42,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:42,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8470222/5bae32065c8e4776b23c8992ff0f6c12/FLAG45be29aab [2025-03-03 21:36:42,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8470222/5bae32065c8e4776b23c8992ff0f6c12 [2025-03-03 21:36:42,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:36:42,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:36:42,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:42,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:36:42,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:36:42,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a122bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42, skipping insertion in model container [2025-03-03 21:36:42,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:36:42,696 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2025-03-03 21:36:42,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:42,766 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:36:42,777 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_fillercode_fillercodestructure_filler-ps-ci_file-27.i[919,932] [2025-03-03 21:36:42,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:42,817 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:36:42,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42 WrapperNode [2025-03-03 21:36:42,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:42,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:42,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:36:42,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:36:42,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,861 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 21:36:42,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:42,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:36:42,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:36:42,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:36:42,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,893 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-03 21:36:42,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:36:42,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:36:42,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:36:42,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:36:42,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (1/1) ... [2025-03-03 21:36:42,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:42,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:42,952 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-03 21:36:42,958 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-03 21:36:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:36:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:36:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:36:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:36:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:36:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:36:43,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:36:43,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:36:47,478 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:36:47,478 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:36:47,487 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:36:47,487 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:36:47,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:47 BoogieIcfgContainer [2025-03-03 21:36:47,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:36:47,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:36:47,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:36:47,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:36:47,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:36:42" (1/3) ... [2025-03-03 21:36:47,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f62d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:47, skipping insertion in model container [2025-03-03 21:36:47,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:42" (2/3) ... [2025-03-03 21:36:47,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f62d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:47, skipping insertion in model container [2025-03-03 21:36:47,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:47" (3/3) ... [2025-03-03 21:36:47,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i [2025-03-03 21:36:47,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:36:47,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-27.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:36:47,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:36:47,558 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;@5f1deed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:36:47,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:36:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 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-03 21:36:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 21:36:47,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:47,568 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-03 21:36:47,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1583614817, now seen corresponding path program 1 times [2025-03-03 21:36:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355187374] [2025-03-03 21:36:47,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:47,579 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-03 21:36:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:47,581 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-03 21:36:47,582 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-03 21:36:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 21:36:47,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 21:36:47,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:47,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:47,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:36:47,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-03 21:36:47,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:47,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355187374] [2025-03-03 21:36:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355187374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:36:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900179605] [2025-03-03 21:36:47,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:36:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:48,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:36:48,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:36:48,014 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-03 21:36:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:48,032 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-03-03 21:36:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:36:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 169 [2025-03-03 21:36:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:48,037 INFO L225 Difference]: With dead ends: 160 [2025-03-03 21:36:48,037 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 21:36:48,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-03 21:36:48,041 INFO L435 NwaCegarLoop]: 122 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, 122 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-03 21:36:48,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 21:36:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 21:36:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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-03 21:36:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-03-03 21:36:48,078 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 169 [2025-03-03 21:36:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:48,079 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-03-03 21:36:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-03 21:36:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-03-03 21:36:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 21:36:48,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:48,082 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-03 21:36:48,094 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-03 21:36:48,282 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-03 21:36:48,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:48,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1476927847, now seen corresponding path program 1 times [2025-03-03 21:36:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41098035] [2025-03-03 21:36:48,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:48,284 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-03 21:36:48,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:48,286 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-03 21:36:48,288 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-03 21:36:48,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 21:36:48,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 21:36:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:48,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:36:48,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 21:36:48,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:36:49,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:49,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41098035] [2025-03-03 21:36:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41098035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:36:49,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:36:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 21:36:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823445900] [2025-03-03 21:36:49,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:36:49,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:36:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:49,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:36:49,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:49,438 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 21:36:51,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:36:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:51,780 INFO L93 Difference]: Finished difference Result 163 states and 246 transitions. [2025-03-03 21:36:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:36:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 169 [2025-03-03 21:36:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:51,807 INFO L225 Difference]: With dead ends: 163 [2025-03-03 21:36:51,807 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 21:36:51,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:36:51,809 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 129 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:51,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 211 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 21:36:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 21:36:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-03-03 21:36:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:36:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2025-03-03 21:36:51,819 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 169 [2025-03-03 21:36:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:51,820 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2025-03-03 21:36:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 21:36:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2025-03-03 21:36:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 21:36:51,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:51,822 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-03 21:36:51,835 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 (3)] Ended with exit code 0 [2025-03-03 21:36:52,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-03 21:36:52,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1144686504, now seen corresponding path program 1 times [2025-03-03 21:36:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054500945] [2025-03-03 21:36:52,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:52,023 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-03 21:36:52,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:52,025 INFO L229 MonitoredProcess]: Starting monitored process 4 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-03 21:36:52,026 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 (4)] Waiting until timeout for monitored process [2025-03-03 21:36:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 21:36:52,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 21:36:52,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:52,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:52,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:36:52,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 21:36:53,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:53,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054500945] [2025-03-03 21:36:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054500945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1806730475] [2025-03-03 21:36:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:53,354 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:36:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:36:53,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:36:53,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 21:36:53,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 21:36:53,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 21:36:53,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:53,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:53,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:36:53,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:54,309 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-03 21:36:54,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:54,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1806730475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:54,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:36:54,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-03 21:36:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236096201] [2025-03-03 21:36:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:54,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:54,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:54,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:36:54,310 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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-03 21:36:57,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:36:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:57,237 INFO L93 Difference]: Finished difference Result 246 states and 366 transitions. [2025-03-03 21:36:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:36:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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-03 21:36:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:57,269 INFO L225 Difference]: With dead ends: 246 [2025-03-03 21:36:57,269 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 21:36:57,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:36:57,270 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:57,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 21:36:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 21:36:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2025-03-03 21:36:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:36:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2025-03-03 21:36:57,292 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 169 [2025-03-03 21:36:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:57,293 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2025-03-03 21:36:57,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 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-03 21:36:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2025-03-03 21:36:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 21:36:57,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:57,294 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-03 21:36:57,309 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 (4)] Ended with exit code 0 [2025-03-03 21:36:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 21:36:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:36:57,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash 91056399, now seen corresponding path program 1 times [2025-03-03 21:36:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673755411] [2025-03-03 21:36:57,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:57,697 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-03 21:36:57,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:57,698 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 21:36:57,699 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 (6)] Waiting until timeout for monitored process [2025-03-03 21:36:57,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:36:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:36:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:58,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:36:58,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 21:36:58,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:36:58,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673755411] [2025-03-03 21:36:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673755411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432248568] [2025-03-03 21:36:58,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:58,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:36:58,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:36:58,898 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:36:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-03 21:36:58,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:36:59,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:36:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:59,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:59,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:36:59,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:59,655 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-03 21:36:59,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432248568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:59,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:36:59,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 21:36:59,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646977569] [2025-03-03 21:36:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:59,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:59,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:59,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:59,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:36:59,658 INFO L87 Difference]: Start difference. First operand 161 states and 238 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-03 21:37:00,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:37:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:01,011 INFO L93 Difference]: Finished difference Result 383 states and 568 transitions. [2025-03-03 21:37:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:01,011 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-03 21:37:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:01,013 INFO L225 Difference]: With dead ends: 383 [2025-03-03 21:37:01,013 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 21:37:01,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:37:01,015 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 116 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 297 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 21:37:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 21:37:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 161. [2025-03-03 21:37:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 104 states have internal predecessors, (132), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:37:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2025-03-03 21:37:01,039 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 170 [2025-03-03 21:37:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2025-03-03 21:37:01,039 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-03 21:37:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2025-03-03 21:37:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:37:01,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:01,041 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-03 21:37:01,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-03 21:37:01,254 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 (6)] Ended with exit code 0 [2025-03-03 21:37:01,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-03 21:37:01,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:01,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash -666204938, now seen corresponding path program 1 times [2025-03-03 21:37:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:37:01,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450182246] [2025-03-03 21:37:01,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:01,442 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-03 21:37:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:37:01,444 INFO L229 MonitoredProcess]: Starting monitored process 8 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-03 21:37:01,445 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 (8)] Waiting until timeout for monitored process [2025-03-03 21:37:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:37:01,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:37:01,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:01,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:01,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:37:01,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:37:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 21:37:02,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:37:02,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:37:02,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450182246] [2025-03-03 21:37:02,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450182246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:37:02,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123623112] [2025-03-03 21:37:02,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:37:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:37:02,671 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:37:02,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-03 21:37:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:37:03,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:37:03,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:03,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:03,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 21:37:03,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:37:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 745 proven. 135 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 21:37:05,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:37:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 153 proven. 129 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-03 21:37:07,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2123623112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:37:07,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:37:07,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 15] total 34 [2025-03-03 21:37:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402354443] [2025-03-03 21:37:07,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:37:07,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 21:37:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:37:07,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 21:37:07,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 21:37:07,470 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 34 states, 33 states have (on average 3.909090909090909) internal successors, (129), 32 states have internal predecessors, (129), 11 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (57), 11 states have call predecessors, (57), 11 states have call successors, (57) [2025-03-03 21:37:13,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:37:17,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:37:18,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:37:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:21,736 INFO L93 Difference]: Finished difference Result 529 states and 711 transitions. [2025-03-03 21:37:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-03 21:37:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.909090909090909) internal successors, (129), 32 states have internal predecessors, (129), 11 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (57), 11 states have call predecessors, (57), 11 states have call successors, (57) Word has length 171 [2025-03-03 21:37:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:21,739 INFO L225 Difference]: With dead ends: 529 [2025-03-03 21:37:21,739 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 21:37:21,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2527, Invalid=9245, Unknown=0, NotChecked=0, Total=11772 [2025-03-03 21:37:21,743 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 684 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:21,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 689 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-03-03 21:37:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 21:37:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2025-03-03 21:37:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 219 states have (on average 1.1552511415525115) internal successors, (253), 220 states have internal predecessors, (253), 90 states have call successors, (90), 26 states have call predecessors, (90), 26 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 21:37:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 433 transitions. [2025-03-03 21:37:21,784 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 433 transitions. Word has length 171 [2025-03-03 21:37:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:21,785 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 433 transitions. [2025-03-03 21:37:21,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.909090909090909) internal successors, (129), 32 states have internal predecessors, (129), 11 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (57), 11 states have call predecessors, (57), 11 states have call successors, (57) [2025-03-03 21:37:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 433 transitions. [2025-03-03 21:37:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:37:21,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:21,787 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, 1] [2025-03-03 21:37:21,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-03 21:37:22,001 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 (8)] Ended with exit code 0 [2025-03-03 21:37:22,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-03 21:37:22,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -46088753, now seen corresponding path program 1 times [2025-03-03 21:37:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:37:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047835246] [2025-03-03 21:37:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:22,189 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-03 21:37:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:37:22,190 INFO L229 MonitoredProcess]: Starting monitored process 10 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-03 21:37:22,192 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 (10)] Waiting until timeout for monitored process [2025-03-03 21:37:22,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:37:22,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:37:22,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:22,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:22,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:37:22,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:37:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 514 proven. 108 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-03 21:37:43,611 INFO L312 TraceCheckSpWp]: Computing backward predicates...