./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:42,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:42,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:47:42,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:42,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:42,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:42,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:42,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:42,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:42,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:42,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:42,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:42,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:42,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:42,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:42,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:42,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:42,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:42,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:47:42,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:42,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:42,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:42,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:42,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:42,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:42,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:42,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:42,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:42,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:42,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:42,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:42,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:42,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:42,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:42,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:42,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:42,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:47:42,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:47:42,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:42,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:42,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:42,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:42,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-13 04:47:43,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:43,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:43,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:43,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:43,078 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:43,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2024-10-13 04:47:44,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:44,825 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:44,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2024-10-13 04:47:44,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7919cda9/96d395d2c50642aabca49729b96dd9d9/FLAGa687b0987 [2024-10-13 04:47:44,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7919cda9/96d395d2c50642aabca49729b96dd9d9 [2024-10-13 04:47:44,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:44,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:44,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:44,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:44,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:44,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:44" (1/1) ... [2024-10-13 04:47:44,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab930c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:44, skipping insertion in model container [2024-10-13 04:47:44,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:44" (1/1) ... [2024-10-13 04:47:44,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:45,035 WARN L248 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] [2024-10-13 04:47:45,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:45,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:45,135 WARN L248 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] [2024-10-13 04:47:45,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:45,206 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:45,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45 WrapperNode [2024-10-13 04:47:45,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:45,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:45,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:45,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:45,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,282 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-10-13 04:47:45,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:45,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:45,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:45,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:45,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,343 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]. [2024-10-13 04:47:45,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:45,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:45,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:45,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:45,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (1/1) ... [2024-10-13 04:47:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:45,413 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) [2024-10-13 04:47:45,416 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 [2024-10-13 04:47:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:45,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:47:45,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:45,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:45,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:45,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:47:46,011 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-13 04:47:46,011 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:47:46,044 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:47:46,044 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:47:46,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:46 BoogieIcfgContainer [2024-10-13 04:47:46,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:47:46,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:47:46,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:47:46,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:47:46,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:44" (1/3) ... [2024-10-13 04:47:46,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352a75ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:46, skipping insertion in model container [2024-10-13 04:47:46,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:45" (2/3) ... [2024-10-13 04:47:46,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352a75ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:46, skipping insertion in model container [2024-10-13 04:47:46,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:46" (3/3) ... [2024-10-13 04:47:46,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-0.i [2024-10-13 04:47:46,064 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:47:46,065 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:47:46,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:47:46,120 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;@bd8cf72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:47:46,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:47:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 73 states have internal predecessors, (109), 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) [2024-10-13 04:47:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:47:46,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:46,135 INFO L215 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] [2024-10-13 04:47:46,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:46,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash -697111791, now seen corresponding path program 1 times [2024-10-13 04:47:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007291024] [2024-10-13 04:47:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:47:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:47:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:47:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:47:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:47:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 04:47:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 04:47:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 04:47:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 04:47:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 04:47:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 04:47:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 04:47:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 04:47:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 04:47:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 04:47:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 04:47:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 04:47:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 04:47:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:47:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 04:47:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:47:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 04:47:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007291024] [2024-10-13 04:47:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007291024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:46,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:46,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:47:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511747827] [2024-10-13 04:47:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:47:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:47:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:46,580 INFO L87 Difference]: Start difference. First operand has 97 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 73 states have internal predecessors, (109), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 04:47:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:46,617 INFO L93 Difference]: Finished difference Result 181 states and 309 transitions. [2024-10-13 04:47:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:47:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 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 148 [2024-10-13 04:47:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:46,625 INFO L225 Difference]: With dead ends: 181 [2024-10-13 04:47:46,625 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 04:47:46,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:46,633 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:46,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:47:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 04:47:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 04:47:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 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) [2024-10-13 04:47:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-10-13 04:47:46,676 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 148 [2024-10-13 04:47:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-10-13 04:47:46,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 04:47:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-10-13 04:47:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:47:46,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:46,680 INFO L215 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] [2024-10-13 04:47:46,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:47:46,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:46,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash -830952939, now seen corresponding path program 1 times [2024-10-13 04:47:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982933259] [2024-10-13 04:47:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:47:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:47:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:47:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:47:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:47:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 04:47:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 04:47:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 04:47:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 04:47:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 04:47:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 04:47:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 04:47:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 04:47:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 04:47:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 04:47:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 04:47:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 04:47:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 04:47:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:47:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 04:47:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:47:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 04:47:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982933259] [2024-10-13 04:47:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982933259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:47:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654683556] [2024-10-13 04:47:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:47:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:47:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:47:47,516 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-10-13 04:47:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:47,916 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2024-10-13 04:47:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:47:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 148 [2024-10-13 04:47:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:47,921 INFO L225 Difference]: With dead ends: 321 [2024-10-13 04:47:47,922 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 04:47:47,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:47:47,925 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 248 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:47,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 376 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:47:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 04:47:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 88. [2024-10-13 04:47:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.390625) internal successors, (89), 64 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) [2024-10-13 04:47:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-10-13 04:47:47,951 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 148 [2024-10-13 04:47:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:47,955 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-10-13 04:47:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-10-13 04:47:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-10-13 04:47:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:47:47,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:47,959 INFO L215 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] [2024-10-13 04:47:47,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:47:47,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 180164311, now seen corresponding path program 1 times [2024-10-13 04:47:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428396592] [2024-10-13 04:47:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:47:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424413317] [2024-10-13 04:47:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:48,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:48,120 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) [2024-10-13 04:47:48,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:47:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:48,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:47:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:48,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:47:48,415 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:47:48,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:47:48,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:47:48,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:48,625 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:47:48,740 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:47:48,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:47:48 BoogieIcfgContainer [2024-10-13 04:47:48,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:47:48,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:47:48,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:47:48,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:47:48,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:46" (3/4) ... [2024-10-13 04:47:48,745 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:47:48,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:47:48,747 INFO L158 Benchmark]: Toolchain (without parser) took 3884.78ms. Allocated memory was 176.2MB in the beginning and 325.1MB in the end (delta: 148.9MB). Free memory was 117.9MB in the beginning and 100.9MB in the end (delta: 17.0MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:48,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 99.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.12ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 90.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,748 INFO L158 Benchmark]: Boogie Preprocessor took 101.31ms. Allocated memory is still 176.2MB. Free memory was 90.6MB in the beginning and 78.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,750 INFO L158 Benchmark]: RCFGBuilder took 658.67ms. Allocated memory was 176.2MB in the beginning and 325.1MB in the end (delta: 148.9MB). Free memory was 78.7MB in the beginning and 276.5MB in the end (delta: -197.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,751 INFO L158 Benchmark]: TraceAbstraction took 2696.16ms. Allocated memory is still 325.1MB. Free memory was 275.4MB in the beginning and 100.9MB in the end (delta: 174.5MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2024-10-13 04:47:48,751 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 325.1MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:48,752 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.14ms. Allocated memory is still 176.2MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 99.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.12ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 90.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.31ms. Allocated memory is still 176.2MB. Free memory was 90.6MB in the beginning and 78.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 658.67ms. Allocated memory was 176.2MB in the beginning and 325.1MB in the end (delta: 148.9MB). Free memory was 78.7MB in the beginning and 276.5MB in the end (delta: -197.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2696.16ms. Allocated memory is still 325.1MB. Free memory was 275.4MB in the beginning and 100.9MB in the end (delta: 174.5MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 325.1MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, 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; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_15 = var_1_15 [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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, 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=-34, var_1_31=-224, var_1_32=62, 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=-34, var_1_31=-224, var_1_32=62, 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=-34, var_1_31=-224, var_1_32=62, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-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] [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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-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] 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, 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=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_36=15/2, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_36=15/2, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=-129, 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=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_11=0, var_1_14=128, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=256, var_1_1=64, var_1_23=47/10, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=256, var_1_1=64, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=256, var_1_1=64, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, 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=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=128, stepLocal_6=32, stepLocal_7=1, var_1_11=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=16, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=32, stepLocal_7=1, var_1_11=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=62, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=62, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=62, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, 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=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=62, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=2, var_1_11=32, var_1_14=128, var_1_15=64, var_1_19=256, var_1_1=128, var_1_29=128, var_1_30=-34, var_1_31=-224, var_1_32=62, var_1_33=63, var_1_34=-193, var_1_35=-705, var_1_37=62, var_1_38=-224, var_1_39=32, var_1_40=1, var_1_41=1, var_1_6=32, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 290 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 149 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1848/1848 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:47:48,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:51,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:51,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:47:51,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:51,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:51,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:51,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:51,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:51,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:51,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:51,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:51,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:51,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:51,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:51,348 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:51,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:51,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:51,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:51,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:51,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:51,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:51,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:51,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:51,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:47:51,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:47:51,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:51,354 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:47:51,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:51,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:51,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:51,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:51,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:51,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:51,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:51,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:51,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:51,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:51,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:51,361 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:47:51,362 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:47:51,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:51,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:51,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:51,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:51,363 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:47:51,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-13 04:47:51,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:51,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:51,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:51,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:51,725 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:51,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2024-10-13 04:47:53,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:53,444 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:53,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-0.i [2024-10-13 04:47:53,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad935aa/dbfd74aa5a5c414ba7004f71397bb7ed/FLAG428fadc2d [2024-10-13 04:47:53,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad935aa/dbfd74aa5a5c414ba7004f71397bb7ed [2024-10-13 04:47:53,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:53,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:53,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:53,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:53,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:53,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53, skipping insertion in model container [2024-10-13 04:47:53,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:53,678 WARN L248 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] [2024-10-13 04:47:53,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:53,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:53,786 WARN L248 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] [2024-10-13 04:47:53,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:53,861 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:53,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53 WrapperNode [2024-10-13 04:47:53,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:53,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:53,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:53,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:53,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,924 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-13 04:47:53,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:53,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:53,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:53,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:53,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,962 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]. [2024-10-13 04:47:53,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:53,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:54,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:54,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:54,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:54,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:54,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (1/1) ... [2024-10-13 04:47:54,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:54,043 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) [2024-10-13 04:47:54,050 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 [2024-10-13 04:47:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:47:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:54,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:54,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:54,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:54,195 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:54,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:48:10,116 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 04:48:10,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:48:10,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:48:10,163 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:48:10,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:48:10 BoogieIcfgContainer [2024-10-13 04:48:10,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:48:10,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:48:10,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:48:10,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:48:10,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:53" (1/3) ... [2024-10-13 04:48:10,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e2fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:48:10, skipping insertion in model container [2024-10-13 04:48:10,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:53" (2/3) ... [2024-10-13 04:48:10,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e2fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:48:10, skipping insertion in model container [2024-10-13 04:48:10,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:48:10" (3/3) ... [2024-10-13 04:48:10,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-0.i [2024-10-13 04:48:10,185 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:48:10,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:48:10,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:48:10,246 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;@45b2b267, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:48:10,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:48:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 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) [2024-10-13 04:48:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 04:48:10,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:48:10,266 INFO L215 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] [2024-10-13 04:48:10,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:48:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:48:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1698641697, now seen corresponding path program 1 times [2024-10-13 04:48:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:48:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082179671] [2024-10-13 04:48:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:48:10,287 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 [2024-10-13 04:48:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:48:10,289 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) [2024-10-13 04:48:10,290 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 [2024-10-13 04:48:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:48:10,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:48:10,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:48:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-13 04:48:10,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:48:10,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:48:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082179671] [2024-10-13 04:48:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082179671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:48:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:48:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:48:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264048908] [2024-10-13 04:48:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:48:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:48:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:48:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:48:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:48:10,929 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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) [2024-10-13 04:48:15,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:48:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:48:15,101 INFO L93 Difference]: Finished difference Result 138 states and 242 transitions. [2024-10-13 04:48:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:48:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 144 [2024-10-13 04:48:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:48:15,159 INFO L225 Difference]: With dead ends: 138 [2024-10-13 04:48:15,159 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 04:48:15,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:48:15,168 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:48:15,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 04:48:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 04:48:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 04:48:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 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) [2024-10-13 04:48:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-10-13 04:48:15,241 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 144 [2024-10-13 04:48:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:48:15,242 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-10-13 04:48:15,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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) [2024-10-13 04:48:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-10-13 04:48:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 04:48:15,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:48:15,249 INFO L215 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] [2024-10-13 04:48:15,268 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 [2024-10-13 04:48:15,453 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 [2024-10-13 04:48:15,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:48:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:48:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1424300069, now seen corresponding path program 1 times [2024-10-13 04:48:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:48:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721245227] [2024-10-13 04:48:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:48:15,457 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 [2024-10-13 04:48:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:48:15,460 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) [2024-10-13 04:48:15,463 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 [2024-10-13 04:48:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:48:16,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 04:48:16,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:48:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-10-13 04:48:17,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:48:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 04:48:18,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:48:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721245227] [2024-10-13 04:48:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721245227] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 04:48:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:48:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-13 04:48:18,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100846393] [2024-10-13 04:48:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:48:18,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:48:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:48:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:48:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:48:18,768 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 04:48:24,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-13 04:48:28,911 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 [1] [2024-10-13 04:48:32,916 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 [1] [2024-10-13 04:48:37,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:48:41,214 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 [1] [2024-10-13 04:48:45,227 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 [] [2024-10-13 04:48:49,234 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 [] [2024-10-13 04:48:53,239 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 [1] [2024-10-13 04:48:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:48:56,025 INFO L93 Difference]: Finished difference Result 310 states and 472 transitions. [2024-10-13 04:48:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:48:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-13 04:48:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:48:56,029 INFO L225 Difference]: With dead ends: 310 [2024-10-13 04:48:56,030 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 04:48:56,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:48:56,032 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 258 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 90 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:48:56,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 126 Invalid, 8 Unknown, 0 Unchecked, 37.0s Time] [2024-10-13 04:48:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 04:48:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 71. [2024-10-13 04:48:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 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) [2024-10-13 04:48:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-13 04:48:56,046 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 144 [2024-10-13 04:48:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:48:56,048 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-13 04:48:56,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 04:48:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-13 04:48:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 04:48:56,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:48:56,050 INFO L215 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] [2024-10-13 04:48:56,072 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 [2024-10-13 04:48:56,254 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 [2024-10-13 04:48:56,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:48:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:48:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1817327079, now seen corresponding path program 1 times [2024-10-13 04:48:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:48:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950430997] [2024-10-13 04:48:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:48:56,256 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 [2024-10-13 04:48:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:48:56,258 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) [2024-10-13 04:48:56,259 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 [2024-10-13 04:48:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:48:57,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-13 04:48:57,128 INFO L278 TraceCheckSpWp]: Computing forward predicates...