./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:03:42,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:03:42,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:03:42,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:03:42,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:03:43,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:03:43,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:03:43,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:03:43,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:03:43,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:03:43,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:03:43,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:03:43,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:03:43,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:03:43,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:03:43,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:03:43,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:03:43,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:03:43,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:03:43,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:03:43,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:03:43,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:03:43,024 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-03-03 20:03:43,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:03:43,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:03:43,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:03:43,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:03:43,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:03:43,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:44,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad3099b3/3e693e5baad44b25b359724bf395ca46/FLAG80ea237f8 [2025-03-03 20:03:44,613 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:03:44,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:44,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad3099b3/3e693e5baad44b25b359724bf395ca46/FLAG80ea237f8 [2025-03-03 20:03:44,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad3099b3/3e693e5baad44b25b359724bf395ca46 [2025-03-03 20:03:44,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:03:44,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:03:44,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:03:44,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:03:44,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:03:44,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:03:44" (1/1) ... [2025-03-03 20:03:44,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ae290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:44, skipping insertion in model container [2025-03-03 20:03:44,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:03:44" (1/1) ... [2025-03-03 20:03:44,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:03:45,033 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_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-03 20:03:45,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:03:45,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:03:45,115 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_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-03 20:03:45,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:03:45,166 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:03:45,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45 WrapperNode [2025-03-03 20:03:45,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:03:45,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:03:45,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:03:45,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:03:45,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,216 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-03-03 20:03:45,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:03:45,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:03:45,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:03:45,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:03:45,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:03:45,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:03:45,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:03:45,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:03:45,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:03:45,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (1/1) ... [2025-03-03 20:03:45,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:03:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:03:45,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:03:45,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:03:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:03:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:03:45,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:03:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:03:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:03:45,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:03:45,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:03:45,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:03:45,654 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:03:45,654 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:03:45,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:03:45,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:03:45,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:03:45 BoogieIcfgContainer [2025-03-03 20:03:45,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:03:45,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:03:45,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:03:45,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:03:45,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:03:44" (1/3) ... [2025-03-03 20:03:45,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8e55d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:03:45, skipping insertion in model container [2025-03-03 20:03:45,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:45" (2/3) ... [2025-03-03 20:03:45,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8e55d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:03:45, skipping insertion in model container [2025-03-03 20:03:45,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:03:45" (3/3) ... [2025-03-03 20:03:45,670 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:45,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:03:45,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:03:45,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:03:45,722 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;@13814dc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:03:45,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:03:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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-03 20:03:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 20:03:45,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:45,736 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, 1] [2025-03-03 20:03:45,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:45,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1145251675, now seen corresponding path program 1 times [2025-03-03 20:03:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:03:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684429940] [2025-03-03 20:03:45,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:03:45,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 20:03:45,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 20:03:45,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:45,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:45,957 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-03 20:03:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:03:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684429940] [2025-03-03 20:03:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684429940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:03:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981668964] [2025-03-03 20:03:45,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:45,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:03:45,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:03:45,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:03:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:03:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 20:03:46,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 20:03:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:46,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:03:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:03:46,127 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-03 20:03:46,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:03:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981668964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:03:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:03:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711280868] [2025-03-03 20:03:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:46,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:03:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:03:46,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:03:46,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:03:46,150 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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.0) internal successors, (38), 2 states have internal predecessors, (38), 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-03 20:03:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:46,196 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2025-03-03 20:03:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:03:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 143 [2025-03-03 20:03:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:46,208 INFO L225 Difference]: With dead ends: 144 [2025-03-03 20:03:46,208 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 20:03:46,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:03:46,214 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:46,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 20:03:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 20:03:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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-03 20:03:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2025-03-03 20:03:46,247 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 143 [2025-03-03 20:03:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2025-03-03 20:03:46,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-03 20:03:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2025-03-03 20:03:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 20:03:46,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:46,254 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, 1] [2025-03-03 20:03:46,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:03:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:03:46,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1438479995, now seen corresponding path program 1 times [2025-03-03 20:03:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:03:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629324058] [2025-03-03 20:03:46,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:03:46,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 20:03:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 20:03:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:46,639 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-03 20:03:46,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:03:46,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629324058] [2025-03-03 20:03:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629324058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:46,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:03:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066973862] [2025-03-03 20:03:46,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:46,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:03:46,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:46,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:46,642 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 20:03:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:46,681 INFO L93 Difference]: Finished difference Result 197 states and 313 transitions. [2025-03-03 20:03:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:46,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 143 [2025-03-03 20:03:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:46,683 INFO L225 Difference]: With dead ends: 197 [2025-03-03 20:03:46,683 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 20:03:46,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:46,684 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 86 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:46,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 20:03:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-03-03 20:03:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 20:03:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 198 transitions. [2025-03-03 20:03:46,703 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 198 transitions. Word has length 143 [2025-03-03 20:03:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:46,704 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 198 transitions. [2025-03-03 20:03:46,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 20:03:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 198 transitions. [2025-03-03 20:03:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:46,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:46,708 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, 1, 1] [2025-03-03 20:03:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:03:46,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1066999231, now seen corresponding path program 1 times [2025-03-03 20:03:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:03:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373959943] [2025-03-03 20:03:46,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:03:46,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:46,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:46,958 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-03 20:03:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:03:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373959943] [2025-03-03 20:03:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373959943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:03:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854605490] [2025-03-03 20:03:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:03:46,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:46,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:46,962 INFO L87 Difference]: Start difference. First operand 125 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 20:03:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:47,005 INFO L93 Difference]: Finished difference Result 369 states and 588 transitions. [2025-03-03 20:03:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:47,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 144 [2025-03-03 20:03:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:47,009 INFO L225 Difference]: With dead ends: 369 [2025-03-03 20:03:47,009 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 20:03:47,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:47,010 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 70 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:47,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 20:03:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2025-03-03 20:03:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 164 states have (on average 1.451219512195122) internal successors, (238), 166 states have internal predecessors, (238), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 20:03:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 390 transitions. [2025-03-03 20:03:47,059 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 390 transitions. Word has length 144 [2025-03-03 20:03:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:47,059 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 390 transitions. [2025-03-03 20:03:47,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 20:03:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 390 transitions. [2025-03-03 20:03:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:47,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:47,061 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, 1, 1] [2025-03-03 20:03:47,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:03:47,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:47,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash 561440606, now seen corresponding path program 1 times [2025-03-03 20:03:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:03:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417365592] [2025-03-03 20:03:47,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:03:47,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:47,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:47,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:47,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:47,272 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-03 20:03:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:03:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417365592] [2025-03-03 20:03:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417365592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:47,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:03:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377241371] [2025-03-03 20:03:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:47,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:03:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:47,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:47,277 INFO L87 Difference]: Start difference. First operand 245 states and 390 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 20:03:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:47,361 INFO L93 Difference]: Finished difference Result 725 states and 1156 transitions. [2025-03-03 20:03:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 144 [2025-03-03 20:03:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:47,365 INFO L225 Difference]: With dead ends: 725 [2025-03-03 20:03:47,368 INFO L226 Difference]: Without dead ends: 483 [2025-03-03 20:03:47,370 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-03 20:03:47,371 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:47,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-03 20:03:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2025-03-03 20:03:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 312 states have (on average 1.3974358974358974) internal successors, (436), 316 states have internal predecessors, (436), 152 states have call successors, (152), 8 states have call predecessors, (152), 8 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-03 20:03:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 740 transitions. [2025-03-03 20:03:47,433 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 740 transitions. Word has length 144 [2025-03-03 20:03:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:47,433 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 740 transitions. [2025-03-03 20:03:47,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 20:03:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 740 transitions. [2025-03-03 20:03:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:47,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:47,435 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, 1, 1] [2025-03-03 20:03:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:03:47,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:47,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 592840320, now seen corresponding path program 1 times [2025-03-03 20:03:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:03:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086303307] [2025-03-03 20:03:47,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:03:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:47,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:03:47,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131880895] [2025-03-03 20:03:47,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:03:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:03:47,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:03:47,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:03:47,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:47,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:47,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:47,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:03:47,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:03:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:47,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:47,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:47,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:03:47,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:03:47,728 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:03:47,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:03:47,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:03:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:03:47,933 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 20:03:48,016 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:03:48,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:03:48 BoogieIcfgContainer [2025-03-03 20:03:48,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:03:48,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:03:48,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:03:48,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:03:48,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:03:45" (3/4) ... [2025-03-03 20:03:48,024 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:03:48,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:03:48,027 INFO L158 Benchmark]: Toolchain (without parser) took 3111.60ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 55.2MB in the end (delta: 69.2MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2025-03-03 20:03:48,027 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:03:48,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.15ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 108.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:03:48,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.17ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 105.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:03:48,028 INFO L158 Benchmark]: Boogie Preprocessor took 49.04ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 101.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:03:48,029 INFO L158 Benchmark]: IcfgBuilder took 393.02ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 77.6MB in the end (delta: 23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:03:48,029 INFO L158 Benchmark]: TraceAbstraction took 2353.55ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 55.2MB in the end (delta: 21.2MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2025-03-03 20:03:48,029 INFO L158 Benchmark]: Witness Printer took 7.74ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:03:48,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.15ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 108.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.17ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 105.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.04ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 101.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 393.02ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 77.6MB in the end (delta: 23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2353.55ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 55.2MB in the end (delta: 21.2MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Witness Printer took 7.74ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 33.1kB). 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 someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_20 = 8; [L36] signed char var_1_21 = 16; [L37] signed char var_1_22 = -64; [L38] signed char var_1_23 = -64; [L39] unsigned char var_1_24 = 0; [L40] signed short int var_1_25 = -5; [L41] unsigned char var_1_26 = 100; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] signed long int last_1_var_1_1 = 32; [L46] unsigned char last_1_var_1_12 = 32; [L47] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_1 = var_1_1 [L168] last_1_var_1_12 = var_1_12 [L169] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L133] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_8=32, var_1_9=-16] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=-16] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L139] var_1_10 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L141] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L141] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L142] var_1_13 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L143] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L144] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L144] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L147] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L147] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L148] var_1_17 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L149] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=8, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L152] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L152] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=-64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L153] var_1_22 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_22 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L154] RET assume_abort_if_not(var_1_22 >= -126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L155] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L155] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L156] var_1_24 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L157] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L158] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L158] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L159] var_1_28 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L160] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L161] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L161] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L163] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L164] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L164] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_20=-191, var_1_21=16, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L180] RET updateVariables() [L181] CALL step() [L51] var_1_19 = var_1_20 [L52] var_1_21 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=-64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L53] COND TRUE var_1_22 <= var_1_21 [L54] var_1_23 = ((((var_1_22) < (64)) ? (var_1_22) : (64))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=-5, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L64] COND TRUE ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) > var_1_21 [L65] var_1_25 = var_1_21 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L67] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L72] COND TRUE ! (var_1_24 && var_1_28) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L73] COND FALSE !(var_1_26 < 32) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L77] signed long int stepLocal_1 = last_1_var_1_18; [L78] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L79] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L86] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L88] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L89] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L100] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L101] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L112] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L117] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L124] COND FALSE !(\read(var_1_14)) [L127] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=-130943, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=-191, var_1_1=32, var_1_20=-191, var_1_21=64, var_1_22=64, var_1_23=64, var_1_24=0, var_1_25=64, var_1_26=100, var_1_27=1, var_1_28=1, var_1_29=1, var_1_4=0, var_1_8=32, var_1_9=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 765 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 453 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4578/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:03:48,046 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_fillercodesize_ps-cn-25_file-89.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 ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:03:49,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:03:49,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:03:49,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:03:49,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:03:49,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:03:49,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:03:49,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:03:49,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:03:49,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:03:49,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:03:49,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:03:49,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:03:49,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:03:49,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:03:49,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:03:49,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:03:49,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:03:49,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:03:49,891 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 -> ca2ad95ae2dd8a1d3907a0fd329eb713e1915a4fcd6158a0d12b0aa5cd5b0f2e [2025-03-03 20:03:50,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:03:50,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:03:50,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:03:50,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:03:50,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:03:50,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:51,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b58d148b/df923a256ed74e1cbac052bf85db79d8/FLAG5ff49f83d [2025-03-03 20:03:51,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:03:51,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:51,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b58d148b/df923a256ed74e1cbac052bf85db79d8/FLAG5ff49f83d [2025-03-03 20:03:51,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b58d148b/df923a256ed74e1cbac052bf85db79d8 [2025-03-03 20:03:51,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:03:51,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:03:51,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:03:51,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:03:51,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:03:51,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:03:51" (1/1) ... [2025-03-03 20:03:51,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5792fa25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:51, skipping insertion in model container [2025-03-03 20:03:51,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:03:51" (1/1) ... [2025-03-03 20:03:51,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:03:51,982 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_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-03 20:03:52,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:03:52,034 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:03:52,042 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_fillercodesize_ps-cn-25_file-89.i[915,928] [2025-03-03 20:03:52,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:03:52,082 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:03:52,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52 WrapperNode [2025-03-03 20:03:52,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:03:52,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:03:52,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:03:52,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:03:52,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,125 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-03 20:03:52,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:03:52,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:03:52,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:03:52,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:03:52,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,155 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:03:52,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:03:52,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:03:52,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:03:52,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:03:52,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (1/1) ... [2025-03-03 20:03:52,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:03:52,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:03:52,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:03:52,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:03:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:03:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:03:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:03:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:03:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:03:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:03:52,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:03:52,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:03:52,733 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:03:52,734 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:03:52,741 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:03:52,742 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:03:52,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:03:52 BoogieIcfgContainer [2025-03-03 20:03:52,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:03:52,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:03:52,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:03:52,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:03:52,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:03:51" (1/3) ... [2025-03-03 20:03:52,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e749f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:03:52, skipping insertion in model container [2025-03-03 20:03:52,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:03:52" (2/3) ... [2025-03-03 20:03:52,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e749f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:03:52, skipping insertion in model container [2025-03-03 20:03:52,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:03:52" (3/3) ... [2025-03-03 20:03:52,748 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i [2025-03-03 20:03:52,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:03:52,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-89.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:03:52,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:03:52,817 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;@3398ee88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:03:52,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:03:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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-03 20:03:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 20:03:52,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:52,831 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, 1] [2025-03-03 20:03:52,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1145251675, now seen corresponding path program 1 times [2025-03-03 20:03:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:03:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347175555] [2025-03-03 20:03:52,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:03:52,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:03:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 20:03:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 20:03:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 20:03:53,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:53,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:03:53,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:03:53,091 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-03 20:03:53,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:03:53,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:03:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347175555] [2025-03-03 20:03:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347175555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:03:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689826230] [2025-03-03 20:03:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:03:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:03:53,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:03:53,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:03:53,125 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-03 20:03:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:53,140 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2025-03-03 20:03:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:03:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 143 [2025-03-03 20:03:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:53,148 INFO L225 Difference]: With dead ends: 144 [2025-03-03 20:03:53,148 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 20:03:53,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:03:53,154 INFO L435 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:53,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 20:03:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 20:03:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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-03 20:03:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2025-03-03 20:03:53,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 143 [2025-03-03 20:03:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:53,183 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2025-03-03 20:03:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-03 20:03:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2025-03-03 20:03:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 20:03:53,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:53,185 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, 1] [2025-03-03 20:03:53,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:03:53,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:53,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1438479995, now seen corresponding path program 1 times [2025-03-03 20:03:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:03:53,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223875489] [2025-03-03 20:03:53,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:03:53,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:03:53,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 20:03:53,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 20:03:53,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 20:03:53,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:53,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:53,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:03:53,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:03:53,616 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-03 20:03:53,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:03:53,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:03:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223875489] [2025-03-03 20:03:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223875489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:53,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:03:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390780310] [2025-03-03 20:03:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:03:53,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:53,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:53,621 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 20:03:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:53,661 INFO L93 Difference]: Finished difference Result 197 states and 313 transitions. [2025-03-03 20:03:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 143 [2025-03-03 20:03:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:53,665 INFO L225 Difference]: With dead ends: 197 [2025-03-03 20:03:53,665 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 20:03:53,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-03 20:03:53,666 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 86 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:53,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 217 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 20:03:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-03-03 20:03:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 20:03:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 198 transitions. [2025-03-03 20:03:53,687 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 198 transitions. Word has length 143 [2025-03-03 20:03:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:53,688 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 198 transitions. [2025-03-03 20:03:53,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 20:03:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 198 transitions. [2025-03-03 20:03:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:53,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:53,689 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, 1, 1] [2025-03-03 20:03:53,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:03:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:53,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1066999231, now seen corresponding path program 1 times [2025-03-03 20:03:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:03:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587313061] [2025-03-03 20:03:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:53,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:03:53,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:03:53,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 20:03:53,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:54,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:54,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:03:54,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:03:54,321 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-03 20:03:54,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:03:54,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:03:54,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587313061] [2025-03-03 20:03:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587313061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:54,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:03:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893152178] [2025-03-03 20:03:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:54,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:03:54,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:54,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:54,322 INFO L87 Difference]: Start difference. First operand 125 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03 20:03:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:54,366 INFO L93 Difference]: Finished difference Result 369 states and 588 transitions. [2025-03-03 20:03:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:54,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 144 [2025-03-03 20:03:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:54,372 INFO L225 Difference]: With dead ends: 369 [2025-03-03 20:03:54,372 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 20:03:54,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-03 20:03:54,376 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:54,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:03:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 20:03:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2025-03-03 20:03:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 164 states have (on average 1.451219512195122) internal successors, (238), 166 states have internal predecessors, (238), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 20:03:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 390 transitions. [2025-03-03 20:03:54,406 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 390 transitions. Word has length 144 [2025-03-03 20:03:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 390 transitions. [2025-03-03 20:03:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03 20:03:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 390 transitions. [2025-03-03 20:03:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:54,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:54,409 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, 1, 1] [2025-03-03 20:03:54,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 20:03:54,609 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-03 20:03:54,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 561440606, now seen corresponding path program 1 times [2025-03-03 20:03:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:03:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735590420] [2025-03-03 20:03:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:03:54,613 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-03 20:03:54,614 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-03 20:03:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:54,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:54,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:54,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:54,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:03:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:03:55,051 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-03 20:03:55,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:03:55,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:03:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735590420] [2025-03-03 20:03:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735590420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:03:55,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:03:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:03:55,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59526980] [2025-03-03 20:03:55,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:03:55,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:03:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:03:55,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:03:55,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:03:55,053 INFO L87 Difference]: Start difference. First operand 245 states and 390 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03 20:03:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:03:55,263 INFO L93 Difference]: Finished difference Result 721 states and 1148 transitions. [2025-03-03 20:03:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:03:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 144 [2025-03-03 20:03:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:03:55,267 INFO L225 Difference]: With dead ends: 721 [2025-03-03 20:03:55,267 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 20:03:55,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-03 20:03:55,269 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:03:55,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 210 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:03:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 20:03:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 469. [2025-03-03 20:03:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 308 states have (on average 1.3896103896103895) internal successors, (428), 312 states have internal predecessors, (428), 152 states have call successors, (152), 8 states have call predecessors, (152), 8 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-03 20:03:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 732 transitions. [2025-03-03 20:03:55,326 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 732 transitions. Word has length 144 [2025-03-03 20:03:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:03:55,326 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 732 transitions. [2025-03-03 20:03:55,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-03 20:03:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 732 transitions. [2025-03-03 20:03:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 20:03:55,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:03:55,328 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, 1, 1] [2025-03-03 20:03:55,337 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-03 20:03:55,532 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-03 20:03:55,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:03:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:03:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 592840320, now seen corresponding path program 1 times [2025-03-03 20:03:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:03:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99221695] [2025-03-03 20:03:55,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:03:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:03:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:03:55,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:03:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 20:03:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 20:03:55,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 20:03:55,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:03:55,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:03:55,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 20:03:55,717 INFO L279 TraceCheckSpWp]: Computing forward predicates...