./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.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 f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:21:51,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:21:51,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:21:51,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:21:51,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:21:51,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:21:51,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:21:51,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:21:51,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:21:51,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:21:51,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:21:51,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:21:51,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:21:51,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:21:51,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:51,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:21:51,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:21:51,972 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 -> f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da [2025-03-08 13:21:52,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:21:52,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:21:52,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:21:52,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:21:52,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:21:52,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:21:53,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6229fed54/715194e885b6456c89bf60cae01c2697/FLAG826e74a22 [2025-03-08 13:21:53,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:21:53,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:21:53,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6229fed54/715194e885b6456c89bf60cae01c2697/FLAG826e74a22 [2025-03-08 13:21:53,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6229fed54/715194e885b6456c89bf60cae01c2697 [2025-03-08 13:21:53,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:21:53,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:21:53,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:21:53,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:21:53,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:21:53,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:21:53" (1/1) ... [2025-03-08 13:21:53,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:53, skipping insertion in model container [2025-03-08 13:21:53,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:21:53" (1/1) ... [2025-03-08 13:21:53,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:21:53,978 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_normal_file-19.i[913,926] [2025-03-08 13:21:54,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:21:54,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:21:54,065 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_normal_file-19.i[913,926] [2025-03-08 13:21:54,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:21:54,095 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:21:54,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54 WrapperNode [2025-03-08 13:21:54,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:21:54,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:21:54,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:21:54,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:21:54,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,153 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-08 13:21:54,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:21:54,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:21:54,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:21:54,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:21:54,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,187 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:21:54,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:21:54,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:21:54,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:21:54,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:21:54,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:54,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:54,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:21:54,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:21:54,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:21:54,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:21:54,309 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:21:54,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:21:54,572 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:21:54,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:21:54,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:21:54,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:21:54,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54 BoogieIcfgContainer [2025-03-08 13:21:54,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:21:54,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:21:54,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:21:54,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:21:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:21:53" (1/3) ... [2025-03-08 13:21:54,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1667893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:21:54, skipping insertion in model container [2025-03-08 13:21:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (2/3) ... [2025-03-08 13:21:54,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1667893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:21:54, skipping insertion in model container [2025-03-08 13:21:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54" (3/3) ... [2025-03-08 13:21:54,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:21:54,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:21:54,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-19.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:21:54,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:21:54,658 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;@5e1a1bf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:21:54,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:21:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:21:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:21:54,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:54,670 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:21:54,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:54,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash 360841801, now seen corresponding path program 1 times [2025-03-08 13:21:54,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:54,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592393730] [2025-03-08 13:21:54,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:54,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:54,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:54,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:54,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:21:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:21:54,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592393730] [2025-03-08 13:21:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592393730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:21:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376101497] [2025-03-08 13:21:54,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:54,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:21:54,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:54,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:21:54,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:21:54,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:55,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:55,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:55,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:21:55,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:21:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:21:55,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:21:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376101497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:21:55,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:21:55,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:21:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326647287] [2025-03-08 13:21:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:21:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:21:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:21:55,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:21:55,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:21:55,080 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:21:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:21:55,102 INFO L93 Difference]: Finished difference Result 122 states and 209 transitions. [2025-03-08 13:21:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:21:55,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-08 13:21:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:21:55,107 INFO L225 Difference]: With dead ends: 122 [2025-03-08 13:21:55,109 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 13:21:55,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:21:55,115 INFO L435 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:21:55,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:21:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 13:21:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 13:21:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:21:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 13:21:55,152 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 142 [2025-03-08 13:21:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:21:55,152 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 13:21:55,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:21:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 13:21:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:21:55,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:55,159 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:21:55,165 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-08 13:21:55,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:21:55,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 331096741, now seen corresponding path program 1 times [2025-03-08 13:21:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:55,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759430913] [2025-03-08 13:21:55,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:55,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:55,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:55,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:55,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:21:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:21:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759430913] [2025-03-08 13:21:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759430913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:21:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:21:55,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:21:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91445376] [2025-03-08 13:21:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:21:55,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:21:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:21:55,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:21:55,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:21:55,820 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:21:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:21:55,970 INFO L93 Difference]: Finished difference Result 192 states and 288 transitions. [2025-03-08 13:21:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:21:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 13:21:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:21:55,974 INFO L225 Difference]: With dead ends: 192 [2025-03-08 13:21:55,974 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 13:21:55,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 13:21:55,975 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:21:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 272 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:21:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 13:21:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2025-03-08 13:21:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 13:21:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 176 transitions. [2025-03-08 13:21:56,002 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 176 transitions. Word has length 142 [2025-03-08 13:21:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:21:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 176 transitions. [2025-03-08 13:21:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:21:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 176 transitions. [2025-03-08 13:21:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:21:56,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:56,005 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:21:56,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:21:56,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash -174461884, now seen corresponding path program 1 times [2025-03-08 13:21:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747912416] [2025-03-08 13:21:56,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:56,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:56,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:56,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:56,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:21:56,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:21:56,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747912416] [2025-03-08 13:21:56,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747912416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:21:56,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:21:56,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:21:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331515748] [2025-03-08 13:21:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:21:56,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:21:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:21:56,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:21:56,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:21:56,242 INFO L87 Difference]: Start difference. First operand 117 states and 176 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:21:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:21:56,290 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2025-03-08 13:21:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:21:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 13:21:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:21:56,294 INFO L225 Difference]: With dead ends: 289 [2025-03-08 13:21:56,295 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 13:21:56,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:21:56,298 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:21:56,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:21:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 13:21:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-03-08 13:21:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 13:21:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2025-03-08 13:21:56,344 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 142 [2025-03-08 13:21:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:21:56,345 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2025-03-08 13:21:56,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:21:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2025-03-08 13:21:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:21:56,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:56,346 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:21:56,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:21:56,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:56,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash -467864891, now seen corresponding path program 1 times [2025-03-08 13:21:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35090525] [2025-03-08 13:21:56,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:56,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:56,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:56,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:56,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:21:56,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:21:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:21:56,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:21:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:21:56,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:21:56,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:21:56,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:21:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:21:56,550 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:21:56,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:21:56,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:21:56 BoogieIcfgContainer [2025-03-08 13:21:56,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:21:56,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:21:56,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:21:56,641 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:21:56,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54" (3/4) ... [2025-03-08 13:21:56,643 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:21:56,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:21:56,645 INFO L158 Benchmark]: Toolchain (without parser) took 2783.43ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 56.4MB in the end (delta: 47.8MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-03-08 13:21:56,645 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:56,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.21ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:21:56,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.21ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 84.7MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:56,647 INFO L158 Benchmark]: Boogie Preprocessor took 54.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 73.7MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:21:56,647 INFO L158 Benchmark]: IcfgBuilder took 374.38ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 47.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:21:56,647 INFO L158 Benchmark]: TraceAbstraction took 2053.42ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 56.4MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:56,647 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:56,649 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.21ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.21ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 84.7MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 73.7MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 374.38ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 47.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2053.42ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 56.4MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someUnaryFLOAToperation at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] unsigned char last_1_var_1_15 = 0; VAL [isInitial=0, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L122] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L86] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L90] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L90] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L91] var_1_7 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L92] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L93] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L93] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L94] var_1_8 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L95] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L96] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L96] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L97] var_1_9 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L98] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L99] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L99] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L100] var_1_12 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L101] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L102] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L102] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L103] var_1_13 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L105] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L105] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L107] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L108] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L109] var_1_23 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L110] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L111] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L111] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L112] var_1_25 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L113] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L114] var_1_26 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L115] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L116] var_1_27 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L117] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L118] var_1_28 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L119] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L133] RET updateVariables() [L134] CALL step() [L47] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L50] COND FALSE !(\read(var_1_10)) [L53] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L55] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L56] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=100, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L58] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L65] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L67] COND TRUE var_1_24 != var_1_24 [L68] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L70] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=127, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L71] COND TRUE stepLocal_1 >= var_1_29 [L72] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L74] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L77] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=127, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L78] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L79] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=128, var_1_24=56843, var_1_29=127, var_1_2=127, var_1_3=0, var_1_6=-16256, var_1_7=32767, var_1_8=32767, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 118 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 533 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 284 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 1276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3654/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:21:56,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_normal_file-19.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 f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:21:58,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:21:58,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:21:58,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:21:58,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:21:58,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:21:58,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:21:58,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:21:58,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:21:58,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:21:58,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:21:58,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:21:58,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:21:58,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:21:58,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:21:58,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:21:58,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:21:58,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:21:58,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:58,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:21:58,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:21:58,641 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 -> f622c0af01874eaee97ead89039fdcab82e6ffe35ddd9b1f07631012a1a2d1da [2025-03-08 13:21:58,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:21:58,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:21:58,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:21:58,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:21:58,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:21:58,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:21:59,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3dd349/9f600730159847dea869a3788b5ab15f/FLAG417b6459b [2025-03-08 13:22:00,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:22:00,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:22:00,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3dd349/9f600730159847dea869a3788b5ab15f/FLAG417b6459b [2025-03-08 13:22:00,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3dd349/9f600730159847dea869a3788b5ab15f [2025-03-08 13:22:00,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:22:00,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:22:00,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:00,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:22:00,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:22:00,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00, skipping insertion in model container [2025-03-08 13:22:00,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:22:00,678 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_normal_file-19.i[913,926] [2025-03-08 13:22:00,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:00,734 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:22:00,741 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_normal_file-19.i[913,926] [2025-03-08 13:22:00,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:00,777 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:22:00,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00 WrapperNode [2025-03-08 13:22:00,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:00,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:00,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:22:00,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:22:00,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,804 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-08 13:22:00,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:00,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:22:00,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:22:00,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:22:00,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:22:00,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:22:00,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:22:00,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:22:00,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:22:00,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (1/1) ... [2025-03-08 13:22:00,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:22:00,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:22:00,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:22:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:22:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:22:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:22:00,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:22:00,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:22:00,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:22:00,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:22:00,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:22:14,623 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:22:14,624 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:22:14,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:22:14,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:22:14,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:14 BoogieIcfgContainer [2025-03-08 13:22:14,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:22:14,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:22:14,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:22:14,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:22:14,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:22:00" (1/3) ... [2025-03-08 13:22:14,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d55628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:14, skipping insertion in model container [2025-03-08 13:22:14,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:00" (2/3) ... [2025-03-08 13:22:14,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d55628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:14, skipping insertion in model container [2025-03-08 13:22:14,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:14" (3/3) ... [2025-03-08 13:22:14,636 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-19.i [2025-03-08 13:22:14,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:22:14,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-19.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:22:14,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:22:14,693 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;@2c92fc7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:22:14,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:22:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:22:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:22:14,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:14,706 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:14,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:14,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash 360841801, now seen corresponding path program 1 times [2025-03-08 13:22:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:14,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227704873] [2025-03-08 13:22:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:14,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:14,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:14,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:22:14,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:22:15,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:22:15,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:15,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:22:15,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 13:22:15,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:15,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227704873] [2025-03-08 13:22:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227704873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:22:15,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328670232] [2025-03-08 13:22:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:15,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:22:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:15,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:22:15,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:15,582 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:22:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:15,598 INFO L93 Difference]: Finished difference Result 122 states and 209 transitions. [2025-03-08 13:22:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:22:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-08 13:22:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:15,602 INFO L225 Difference]: With dead ends: 122 [2025-03-08 13:22:15,603 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 13:22:15,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:15,606 INFO L435 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:22:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 13:22:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 13:22:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:22:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-08 13:22:15,639 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 142 [2025-03-08 13:22:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:15,639 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-08 13:22:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:22:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-08 13:22:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:22:15,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:15,643 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:15,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:22:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:15,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 331096741, now seen corresponding path program 1 times [2025-03-08 13:22:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579691174] [2025-03-08 13:22:15,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:15,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:15,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:22:15,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:22:16,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:22:16,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:16,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:16,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:22:16,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:22:21,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:21,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579691174] [2025-03-08 13:22:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579691174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:21,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:21,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:22:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715036898] [2025-03-08 13:22:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:21,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:22:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:21,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:22:21,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:22:21,046 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:22:25,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:29,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:33,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:38,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:42,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:46,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:50,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:50,233 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2025-03-08 13:22:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:22:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 13:22:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:50,389 INFO L225 Difference]: With dead ends: 203 [2025-03-08 13:22:50,389 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 13:22:50,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:22:50,390 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 49 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:50,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 268 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 29.1s Time] [2025-03-08 13:22:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 13:22:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2025-03-08 13:22:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 13:22:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 176 transitions. [2025-03-08 13:22:50,419 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 176 transitions. Word has length 142 [2025-03-08 13:22:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:50,420 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 176 transitions. [2025-03-08 13:22:50,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:22:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 176 transitions. [2025-03-08 13:22:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:22:50,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:50,424 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:50,453 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-08 13:22:50,624 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-08 13:22:50,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -174461884, now seen corresponding path program 1 times [2025-03-08 13:22:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827596100] [2025-03-08 13:22:50,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:50,629 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-08 13:22:50,630 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-08 13:22:50,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:22:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:22:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:51,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:22:51,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:22:55,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:55,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827596100] [2025-03-08 13:22:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827596100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:22:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658832181] [2025-03-08 13:22:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:55,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:22:55,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:55,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:22:55,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:22:55,688 INFO L87 Difference]: Start difference. First operand 117 states and 176 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:23:00,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:23:04,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:23:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:23:04,683 INFO L93 Difference]: Finished difference Result 345 states and 522 transitions. [2025-03-08 13:23:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:23:04,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 13:23:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:23:04,819 INFO L225 Difference]: With dead ends: 345 [2025-03-08 13:23:04,819 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 13:23:04,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:23:04,822 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:23:04,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-03-08 13:23:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 13:23:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-03-08 13:23:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 136 states have internal predecessors, (168), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 13:23:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 344 transitions. [2025-03-08 13:23:04,855 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 344 transitions. Word has length 142 [2025-03-08 13:23:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:23:04,856 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 344 transitions. [2025-03-08 13:23:04,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:23:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 344 transitions. [2025-03-08 13:23:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:23:04,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:23:04,857 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:23:04,877 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-08 13:23:05,058 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 [2025-03-08 13:23:05,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:23:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:23:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -467864891, now seen corresponding path program 1 times [2025-03-08 13:23:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:23:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274605085] [2025-03-08 13:23:05,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:23:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:23:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:23:05,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:23:05,062 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 (5)] Waiting until timeout for monitored process [2025-03-08 13:23:05,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:23:05,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:23:05,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:23:05,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:23:05,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:23:05,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:23:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 13:23:06,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:23:06,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:23:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274605085] [2025-03-08 13:23:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274605085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:23:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:23:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:23:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586918727] [2025-03-08 13:23:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:23:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:23:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:23:06,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:23:06,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:23:06,258 INFO L87 Difference]: Start difference. First operand 229 states and 344 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:23:10,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:23:15,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:23:20,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:23:24,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:23:28,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 13:23:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:23:29,182 INFO L93 Difference]: Finished difference Result 663 states and 996 transitions. [2025-03-08 13:23:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:23:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 13:23:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:23:29,191 INFO L225 Difference]: With dead ends: 663 [2025-03-08 13:23:29,191 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 13:23:29,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:23:29,194 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:23:29,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 22.9s Time] [2025-03-08 13:23:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 13:23:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 233. [2025-03-08 13:23:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 140 states have internal predecessors, (172), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 13:23:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 348 transitions. [2025-03-08 13:23:29,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 348 transitions. Word has length 142 [2025-03-08 13:23:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:23:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 348 transitions. [2025-03-08 13:23:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 13:23:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 348 transitions. [2025-03-08 13:23:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:23:29,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:23:29,225 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:23:29,246 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 (5)] Ended with exit code 0 [2025-03-08 13:23:29,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:23:29,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:23:29,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:23:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -664378396, now seen corresponding path program 1 times [2025-03-08 13:23:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:23:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349890732] [2025-03-08 13:23:29,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:23:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:23:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:23:29,429 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-08 13:23:29,431 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-08 13:23:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:23:30,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:23:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:23:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:23:30,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 13:23:30,211 INFO L279 TraceCheckSpWp]: Computing forward predicates...