./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.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 d1e5617ddd00267d862b011fbefdf19a5301960803db1d9715e6a52f4d72a1be --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:02:21,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:02:21,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:02:21,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:02:21,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:02:21,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:02:21,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:02:21,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:02:21,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:02:21,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:02:21,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:02:21,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:02:21,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:02:21,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:02:21,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:02:21,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:02:21,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:02:21,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:02:21,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:21,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:02:21,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:02:21,877 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 -> d1e5617ddd00267d862b011fbefdf19a5301960803db1d9715e6a52f4d72a1be [2025-03-08 15:02:22,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:02:22,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:02:22,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:02:22,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:02:22,148 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:02:22,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:23,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5300d97/d9ad731a35764c4680955c90b87dfe5d/FLAG1bcf66856 [2025-03-08 15:02:23,652 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:02:23,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:23,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5300d97/d9ad731a35764c4680955c90b87dfe5d/FLAG1bcf66856 [2025-03-08 15:02:23,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5300d97/d9ad731a35764c4680955c90b87dfe5d [2025-03-08 15:02:23,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:02:23,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:02:23,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:23,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:02:23,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:02:23,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23, skipping insertion in model container [2025-03-08 15:02:23,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:02:24,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i[915,928] [2025-03-08 15:02:24,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:24,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:02:24,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i[915,928] [2025-03-08 15:02:24,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:24,211 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:02:24,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24 WrapperNode [2025-03-08 15:02:24,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:24,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:24,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:02:24,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:02:24,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,293 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2025-03-08 15:02:24,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:24,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:02:24,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:02:24,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:02:24,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:02:24,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:02:24,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:02:24,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:02:24,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:02:24,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (1/1) ... [2025-03-08 15:02:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:24,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:02:24,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:02:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:02:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:02:24,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:02:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:02:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:02:24,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:02:24,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:02:24,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:02:24,885 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-08 15:02:24,915 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-08 15:02:24,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:02:24,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:02:24,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:02:24,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:24 BoogieIcfgContainer [2025-03-08 15:02:24,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:02:24,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:02:24,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:02:24,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:02:24,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:02:23" (1/3) ... [2025-03-08 15:02:24,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c456e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:24, skipping insertion in model container [2025-03-08 15:02:24,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:24" (2/3) ... [2025-03-08 15:02:24,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c456e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:24, skipping insertion in model container [2025-03-08 15:02:24,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:24" (3/3) ... [2025-03-08 15:02:24,938 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:24,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:02:24,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-0.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:02:24,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:02:25,005 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;@558b54d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:02:25,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:02:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:02:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 15:02:25,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:25,021 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:25,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1888660124, now seen corresponding path program 1 times [2025-03-08 15:02:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265150847] [2025-03-08 15:02:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:25,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:25,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:25,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:25,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 15:02:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265150847] [2025-03-08 15:02:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265150847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:02:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879744611] [2025-03-08 15:02:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:25,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:02:25,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:02:25,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:25,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:25,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:02:25,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 15:02:25,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879744611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:02:25,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:02:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433392126] [2025-03-08 15:02:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:25,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:02:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:25,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:02:25,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:25,565 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:02:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:25,595 INFO L93 Difference]: Finished difference Result 188 states and 314 transitions. [2025-03-08 15:02:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:02:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (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 152 [2025-03-08 15:02:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:25,604 INFO L225 Difference]: With dead ends: 188 [2025-03-08 15:02:25,604 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 15:02:25,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:25,609 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:25,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:02:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 15:02:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 15:02:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:02:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2025-03-08 15:02:25,643 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 152 [2025-03-08 15:02:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:25,643 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2025-03-08 15:02:25,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:02:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2025-03-08 15:02:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 15:02:25,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:25,645 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:25,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:02:25,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:02:25,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:25,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1961605978, now seen corresponding path program 1 times [2025-03-08 15:02:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43974289] [2025-03-08 15:02:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:25,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:26,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:26,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:26,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 15:02:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43974289] [2025-03-08 15:02:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43974289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:02:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687051165] [2025-03-08 15:02:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:26,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:02:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:26,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:02:26,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:02:26,638 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 15:02:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:26,967 INFO L93 Difference]: Finished difference Result 290 states and 438 transitions. [2025-03-08 15:02:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:02:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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 152 [2025-03-08 15:02:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:26,972 INFO L225 Difference]: With dead ends: 290 [2025-03-08 15:02:26,972 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 15:02:26,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:02:26,974 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 167 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:26,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 355 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:02:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 15:02:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 119. [2025-03-08 15:02:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:02:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-08 15:02:26,999 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 152 [2025-03-08 15:02:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:27,000 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-08 15:02:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 15:02:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-08 15:02:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 15:02:27,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:27,004 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:02:27,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 716841497, now seen corresponding path program 1 times [2025-03-08 15:02:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169624452] [2025-03-08 15:02:27,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:27,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:27,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:02:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38763936] [2025-03-08 15:02:27,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:27,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:27,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:02:27,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:02:27,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:27,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:02:27,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:02:27,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 15:02:27,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 15:02:27,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:27,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:02:27,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:02:27,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:02:27,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:02:27,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:02:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 15:02:27,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:02:27,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:02:27,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:02:27 BoogieIcfgContainer [2025-03-08 15:02:27,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:02:27,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:02:27,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:02:27,810 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:02:27,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:24" (3/4) ... [2025-03-08 15:02:27,812 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:02:27,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:02:27,813 INFO L158 Benchmark]: Toolchain (without parser) took 3887.58ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 96.9MB in the end (delta: 25.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2025-03-08 15:02:27,813 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.60ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 104.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.57ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 96.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: Boogie Preprocessor took 82.21ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 85.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: IcfgBuilder took 553.54ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 42.1MB in the end (delta: 43.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: TraceAbstraction took 2876.44ms. Allocated memory is still 167.8MB. Free memory was 41.4MB in the beginning and 96.9MB in the end (delta: -55.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:27,814 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 96.9MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:27,815 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.22ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.60ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 104.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.57ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 96.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.21ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 85.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 553.54ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 42.1MB in the end (delta: 43.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2876.44ms. Allocated memory is still 167.8MB. Free memory was 41.4MB in the beginning and 96.9MB in the end (delta: -55.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 96.9MB 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 someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_2 = 99999999999.3; [L24] double var_1_3 = 1.7; [L25] signed long int var_1_6 = 2; [L26] signed long int var_1_8 = 1427256974; [L27] signed short int var_1_11 = 0; [L28] signed long int var_1_14 = 256; [L29] unsigned short int var_1_15 = 2; [L30] signed short int var_1_19 = 32; [L31] double var_1_23 = 4.7; [L32] double var_1_24 = 0.0; [L33] double var_1_25 = 128.25; [L34] float var_1_26 = -0.2; [L35] float var_1_27 = 31.25; [L36] float var_1_28 = 24.4; [L37] unsigned char var_1_29 = 1; [L38] unsigned char var_1_30 = 236; [L39] unsigned char var_1_31 = 5; [L40] unsigned char var_1_32 = 1; [L41] unsigned char var_1_33 = 64; [L42] unsigned char var_1_34 = 100; [L43] unsigned char var_1_35 = 5; [L44] double var_1_36 = 7.5; [L45] signed short int var_1_37 = 16; [L46] unsigned char var_1_38 = 64; [L47] signed char var_1_39 = -1; [L48] unsigned char var_1_40 = 0; [L49] unsigned char var_1_41 = 0; [L50] unsigned short int last_1_var_1_15 = 2; VAL [isInitial=0, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_2=999999999993/10, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_2=999999999993/10, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L128] var_1_2 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L129] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L130] var_1_3 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L131] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L132] var_1_8 = __VERIFIER_nondet_long() [L133] CALL assume_abort_if_not(var_1_8 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L133] RET assume_abort_if_not(var_1_8 >= 1073741823) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L135] var_1_24 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L136] RET assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L137] var_1_25 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L138] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L139] var_1_27 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L140] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L141] var_1_28 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L142] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L143] var_1_30 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_30 >= 222) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L144] RET assume_abort_if_not(var_1_30 >= 222) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L146] var_1_31 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L147] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] CALL assume_abort_if_not(var_1_31 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] RET assume_abort_if_not(var_1_31 <= 32) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L149] var_1_32 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L150] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L152] var_1_33 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L153] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L155] var_1_34 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_34 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L156] RET assume_abort_if_not(var_1_34 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L158] var_1_35 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L159] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] CALL assume_abort_if_not(var_1_35 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] RET assume_abort_if_not(var_1_35 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L162] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L177] RET updateVariables() [L178] CALL step() [L54] var_1_38 = var_1_31 [L55] var_1_39 = var_1_31 [L56] var_1_40 = var_1_41 [L57] unsigned char stepLocal_4 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_4=1, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L58] COND TRUE stepLocal_4 && var_1_40 [L59] var_1_29 = (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_36=15/2, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L61] COND TRUE \read(var_1_40) [L62] var_1_36 = (var_1_28 + var_1_27) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L66] signed long int stepLocal_1 = ~ var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_1=-162, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L67] COND TRUE stepLocal_1 < var_1_8 [L68] var_1_14 = ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L70] unsigned char stepLocal_2 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_2=161, var_1_11=0, var_1_14=161, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L71] COND FALSE !((last_1_var_1_15 + var_1_39) > stepLocal_2) [L76] var_1_15 = (var_1_38 + var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L78] unsigned char stepLocal_3 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_3=1, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L79] COND TRUE var_1_40 && stepLocal_3 [L80] var_1_19 = (var_1_29 + var_1_29) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=64, var_1_23=47/10, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L82] COND TRUE ((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5)))) [L83] var_1_23 = (10.65 - (var_1_24 - var_1_25)) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=64, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L85] COND FALSE !(var_1_38 > var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=64, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L90] COND FALSE !((var_1_2 - var_1_3) == (- var_1_26)) [L97] var_1_1 = var_1_29 VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L99] var_1_6 = (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38)))) [L100] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L101] COND TRUE \read(var_1_40) [L102] var_1_11 = var_1_39 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L108] unsigned char stepLocal_7 = var_1_40; [L109] signed char stepLocal_6 = var_1_39; [L110] unsigned char stepLocal_5 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_5=161, stepLocal_6=0, stepLocal_7=1, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=16, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L111] COND FALSE !(((var_1_35 / var_1_34) % var_1_30) >= stepLocal_5) [L124] var_1_37 = var_1_32 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_6=0, stepLocal_7=1, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR (((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L169] EXPR ((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L169-L170] return (((((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32)))) && (var_1_38 == ((unsigned char) var_1_31))) && (var_1_39 == ((signed char) var_1_31))) && (var_1_40 == ((unsigned char) var_1_41)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=161, var_1_15=0, var_1_19=322, var_1_1=161, var_1_29=161, var_1_30=-288, var_1_31=0, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=-193, var_1_37=63, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_6=0, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 179 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 259 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 85 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2730/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:02:27,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_operatoramount_amount100_file-0.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 d1e5617ddd00267d862b011fbefdf19a5301960803db1d9715e6a52f4d72a1be --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:02:29,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:02:29,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:02:29,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:02:29,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:02:29,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:02:29,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:02:29,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:02:29,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:02:29,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:02:29,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:02:29,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:02:29,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:02:29,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:02:29,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:02:29,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:02:29,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:29,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:02:29,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:02:29,944 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 -> d1e5617ddd00267d862b011fbefdf19a5301960803db1d9715e6a52f4d72a1be [2025-03-08 15:02:30,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:02:30,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:02:30,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:02:30,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:02:30,216 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:02:30,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:31,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adce77f6/0ff93f4fe424421b81d52663ea72cfa2/FLAGc722c0127 [2025-03-08 15:02:31,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:02:31,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:31,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adce77f6/0ff93f4fe424421b81d52663ea72cfa2/FLAGc722c0127 [2025-03-08 15:02:31,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adce77f6/0ff93f4fe424421b81d52663ea72cfa2 [2025-03-08 15:02:31,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:02:31,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:02:31,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:31,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:02:31,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:02:31,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:31" (1/1) ... [2025-03-08 15:02:31,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:31, skipping insertion in model container [2025-03-08 15:02:31,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:31" (1/1) ... [2025-03-08 15:02:31,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:02:32,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i[915,928] [2025-03-08 15:02:32,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:32,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:02:32,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i[915,928] [2025-03-08 15:02:32,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:32,197 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:02:32,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32 WrapperNode [2025-03-08 15:02:32,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:32,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:32,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:02:32,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:02:32,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,245 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-08 15:02:32,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:32,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:02:32,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:02:32,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:02:32,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,272 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:02:32,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:02:32,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:02:32,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:02:32,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:02:32,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (1/1) ... [2025-03-08 15:02:32,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:32,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:02:32,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:02:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:02:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:02:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:02:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:02:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:02:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:02:32,414 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:02:32,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:02:47,637 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 15:02:47,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:02:47,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:02:47,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:02:47,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:47 BoogieIcfgContainer [2025-03-08 15:02:47,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:02:47,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:02:47,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:02:47,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:02:47,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:02:31" (1/3) ... [2025-03-08 15:02:47,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a57427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:47, skipping insertion in model container [2025-03-08 15:02:47,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:32" (2/3) ... [2025-03-08 15:02:47,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a57427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:47, skipping insertion in model container [2025-03-08 15:02:47,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:47" (3/3) ... [2025-03-08 15:02:47,654 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-0.i [2025-03-08 15:02:47,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:02:47,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-0.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:02:47,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:02:47,706 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;@3854bb5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:02:47,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:02:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:02:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 15:02:47,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:47,717 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, 1, 1, 1, 1] [2025-03-08 15:02:47,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1461377659, now seen corresponding path program 1 times [2025-03-08 15:02:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310372081] [2025-03-08 15:02:47,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:02:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:47,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:02:47,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:02:47,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 15:02:48,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 15:02:48,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:48,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:48,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:02:48,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-08 15:02:48,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:48,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310372081] [2025-03-08 15:02:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310372081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:02:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457149299] [2025-03-08 15:02:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:02:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:48,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:02:48,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:48,294 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:02:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:48,309 INFO L93 Difference]: Finished difference Result 145 states and 247 transitions. [2025-03-08 15:02:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:02:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 148 [2025-03-08 15:02:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:48,314 INFO L225 Difference]: With dead ends: 145 [2025-03-08 15:02:48,314 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 15:02:48,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:48,317 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:48,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:02:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 15:02:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 15:02:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:02:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-03-08 15:02:48,352 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 148 [2025-03-08 15:02:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:48,352 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-03-08 15:02:48,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:02:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-03-08 15:02:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 15:02:48,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:48,358 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, 1, 1, 1, 1] [2025-03-08 15:02:48,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:02:48,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:02:48,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 728778051, now seen corresponding path program 1 times [2025-03-08 15:02:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810673752] [2025-03-08 15:02:48,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:02:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:48,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:02:48,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:02:48,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 15:02:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 15:02:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:49,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:02:49,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 15:02:49,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:49,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:49,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810673752] [2025-03-08 15:02:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810673752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:49,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:49,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:02:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724075112] [2025-03-08 15:02:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:49,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:02:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:49,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:02:49,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:02:49,590 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:02:55,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:02:59,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:03:03,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:03:07,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:03:11,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:03:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:03:13,259 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2025-03-08 15:03:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:03:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-03-08 15:03:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:03:13,262 INFO L225 Difference]: With dead ends: 198 [2025-03-08 15:03:13,262 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 15:03:13,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:03:13,263 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 164 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 131 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:03:13,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 393 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 446 Invalid, 5 Unknown, 0 Unchecked, 22.9s Time] [2025-03-08 15:03:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 15:03:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2025-03-08 15:03:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 72 states have internal predecessors, (82), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 15:03:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-03-08 15:03:13,286 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 148 [2025-03-08 15:03:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:03:13,286 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-03-08 15:03:13,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 15:03:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-03-08 15:03:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 15:03:13,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:03:13,288 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, 1, 1, 1, 1] [2025-03-08 15:03:13,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:03:13,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:03:13,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:03:13,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:03:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1725850404, now seen corresponding path program 1 times [2025-03-08 15:03:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:03:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139259433] [2025-03-08 15:03:13,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:03:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:03:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:03:13,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:03:13,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 15:03:13,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 15:03:14,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 15:03:14,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:03:14,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:03:14,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 15:03:14,594 INFO L279 TraceCheckSpWp]: Computing forward predicates...