./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_fillercode_fillercodestructure_filler-ps-ci_file-20.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_fillercode_fillercodestructure_filler-ps-ci_file-20.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 e4d8b25be12ac7c0f83971829851a1917a680012c727d89f67306d428382fca6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:39:38,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:39:38,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:39:38,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:39:38,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:39:38,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:39:38,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:39:38,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:39:38,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:39:38,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:39:38,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:39:38,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:39:38,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:39:38,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:39:38,159 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:39:38,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:39:38,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:39:38,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:39:38,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:39:38,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:39:38,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:39:38,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:39:38,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:39:38,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:39:38,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:39:38,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:39:38,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:39:38,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:39:38,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:39:38,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:39:38,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:39:38,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:39:38,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:39:38,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:39:38,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:39:38,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:39:38,165 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 -> e4d8b25be12ac7c0f83971829851a1917a680012c727d89f67306d428382fca6 [2024-10-13 02:39:38,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:39:38,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:39:38,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:39:38,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:39:38,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:39:38,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:39,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:39:39,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:39:39,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:39,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c482c31/1090251e6f47461ba67fb8ee9e8ec158/FLAG378f15883 [2024-10-13 02:39:39,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c482c31/1090251e6f47461ba67fb8ee9e8ec158 [2024-10-13 02:39:39,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:39:39,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:39:39,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:39:39,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:39:39,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:39:39,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:39:39" (1/1) ... [2024-10-13 02:39:39,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ce084d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:39, skipping insertion in model container [2024-10-13 02:39:39,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:39:39" (1/1) ... [2024-10-13 02:39:39,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:39:39,945 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_fillercode_fillercodestructure_filler-ps-ci_file-20.i[919,932] [2024-10-13 02:39:40,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:39:40,030 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:39:40,039 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_fillercode_fillercodestructure_filler-ps-ci_file-20.i[919,932] [2024-10-13 02:39:40,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:39:40,088 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:39:40,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40 WrapperNode [2024-10-13 02:39:40,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:39:40,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:39:40,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:39:40,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:39:40,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,147 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-10-13 02:39:40,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:39:40,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:39:40,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:39:40,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:39:40,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,179 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 02:39:40,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:39:40,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:39:40,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:39:40,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:39:40,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (1/1) ... [2024-10-13 02:39:40,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:39:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:39:40,249 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 02:39:40,252 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 02:39:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:39:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:39:40,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:39:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:39:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:39:40,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:39:40,370 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:39:40,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:39:40,719 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 02:39:40,720 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:39:40,746 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:39:40,746 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:39:40,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:39:40 BoogieIcfgContainer [2024-10-13 02:39:40,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:39:40,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:39:40,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:39:40,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:39:40,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:39:39" (1/3) ... [2024-10-13 02:39:40,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b796ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:39:40, skipping insertion in model container [2024-10-13 02:39:40,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:40" (2/3) ... [2024-10-13 02:39:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b796ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:39:40, skipping insertion in model container [2024-10-13 02:39:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:39:40" (3/3) ... [2024-10-13 02:39:40,755 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:40,769 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:39:40,769 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:39:40,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:39:40,821 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;@79653999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:39:40,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:39:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:39:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 02:39:40,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:39:40,841 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:40,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:39:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:39:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1419506773, now seen corresponding path program 1 times [2024-10-13 02:39:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:39:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841490096] [2024-10-13 02:39:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:39:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:39:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:39:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:39:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:39:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:39:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:39:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:39:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:39:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:39:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:39:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:39:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:39:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:39:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:39:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:39:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:39:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:39:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:39:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:39:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:39:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:39:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 02:39:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:39:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841490096] [2024-10-13 02:39:41,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841490096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:39:41,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:39:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:39:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070076412] [2024-10-13 02:39:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:39:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:39:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:39:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:39:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:39:41,203 INFO L87 Difference]: Start difference. First operand has 78 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 02:39:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:39:41,240 INFO L93 Difference]: Finished difference Result 153 states and 267 transitions. [2024-10-13 02:39:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:39:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2024-10-13 02:39:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:39:41,281 INFO L225 Difference]: With dead ends: 153 [2024-10-13 02:39:41,285 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 02:39:41,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 02:39:41,298 INFO L432 NwaCegarLoop]: 115 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, 115 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 02:39:41,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:39:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 02:39:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 02:39:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:39:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2024-10-13 02:39:41,364 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 138 [2024-10-13 02:39:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:39:41,365 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2024-10-13 02:39:41,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 02:39:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2024-10-13 02:39:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 02:39:41,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:39:41,367 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:41,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:39:41,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:39:41,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:39:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2000420098, now seen corresponding path program 1 times [2024-10-13 02:39:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:39:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580376435] [2024-10-13 02:39:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:39:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:39:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:39:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:39:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:39:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:39:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:39:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:39:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:39:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:39:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:39:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:39:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:39:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:39:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:39:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:39:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:39:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:39:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:39:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:39:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:39:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:39:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 02:39:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:39:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580376435] [2024-10-13 02:39:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580376435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:39:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:39:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:39:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627000294] [2024-10-13 02:39:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:39:41,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:39:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:39:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:39:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:39:41,590 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:39:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:39:41,660 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2024-10-13 02:39:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:39:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-10-13 02:39:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:39:41,664 INFO L225 Difference]: With dead ends: 186 [2024-10-13 02:39:41,664 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 02:39:41,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:39:41,666 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:39:41,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:39:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 02:39:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-10-13 02:39:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.463768115942029) internal successors, (101), 69 states have internal predecessors, (101), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:39:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-10-13 02:39:41,683 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 139 [2024-10-13 02:39:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:39:41,684 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-10-13 02:39:41,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:39:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-10-13 02:39:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 02:39:41,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:39:41,688 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:39:41,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:39:41,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:39:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash -574828132, now seen corresponding path program 1 times [2024-10-13 02:39:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:39:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084270586] [2024-10-13 02:39:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:39:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:39:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392173426] [2024-10-13 02:39:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:39:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:39:41,863 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 02:39:41,864 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 02:39:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:39:42,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:39:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:39:42,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:39:42,253 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:39:42,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:39:42,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:39:42,455 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 02:39:42,458 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 02:39:42,559 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:39:42,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:39:42 BoogieIcfgContainer [2024-10-13 02:39:42,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:39:42,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:39:42,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:39:42,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:39:42,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:39:40" (3/4) ... [2024-10-13 02:39:42,566 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:39:42,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:39:42,568 INFO L158 Benchmark]: Toolchain (without parser) took 2799.83ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 148.3MB in the end (delta: -27.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:39:42,570 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:39:42,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.93ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 104.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:39:42,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.94ms. Allocated memory is still 190.8MB. Free memory was 104.4MB in the beginning and 99.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:39:42,570 INFO L158 Benchmark]: Boogie Preprocessor took 65.26ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 93.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:39:42,571 INFO L158 Benchmark]: RCFGBuilder took 531.63ms. Allocated memory is still 190.8MB. Free memory was 93.3MB in the beginning and 136.1MB in the end (delta: -42.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-13 02:39:42,571 INFO L158 Benchmark]: TraceAbstraction took 1814.66ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 148.3MB in the end (delta: -12.2MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-10-13 02:39:42,571 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 190.8MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:39:42,576 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.13ms. Allocated memory is still 125.8MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.93ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 104.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.94ms. Allocated memory is still 190.8MB. Free memory was 104.4MB in the beginning and 99.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.26ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 93.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 531.63ms. Allocated memory is still 190.8MB. Free memory was 93.3MB in the beginning and 136.1MB in the end (delta: -42.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1814.66ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 148.3MB in the end (delta: -12.2MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 190.8MB. Free memory is still 148.3MB. 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 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] unsigned short int var_1_8 = 100; [L29] float var_1_9 = 255.75; [L30] signed char var_1_10 = 64; [L31] signed char var_1_11 = 32; [L32] signed char var_1_12 = 4; [L33] float var_1_13 = 0.0; [L34] float var_1_14 = 7.25; [L35] float var_1_15 = 8.125; [L36] float var_1_16 = 24.5; [L37] signed short int var_1_17 = -256; [L38] double var_1_18 = 31.5; [L39] float var_1_19 = 255.2; [L40] signed long int var_1_21 = -8; [L41] double var_1_22 = 0.5; [L42] unsigned short int var_1_23 = 200; [L43] double var_1_26 = 1.8; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_37 = 1; [L46] unsigned char var_1_39 = 0; [L47] unsigned char var_1_40 = 0; [L48] unsigned long int var_1_41 = 10; [L49] unsigned char last_1_var_1_6 = 32; [L50] unsigned short int last_1_var_1_8 = 100; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_6 = var_1_6 [L165] last_1_var_1_8 = var_1_8 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L129] var_1_2 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L130] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L132] var_1_3 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L133] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L136] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L141] var_1_10 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L142] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L144] var_1_11 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L145] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L147] var_1_12 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L148] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L151] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L153] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L154] var_1_16 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L155] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L156] var_1_39 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L157] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] CALL assume_abort_if_not(var_1_40 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] RET assume_abort_if_not(var_1_40 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L176] RET updateVariables() [L177] CALL step() [L54] var_1_19 = var_1_16 [L55] var_1_21 = -16 [L56] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L57] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L64] COND FALSE !(var_1_5 > var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L67] COND TRUE (var_1_2 || var_1_2) || ((- var_1_16) <= var_1_14) [L68] var_1_26 = ((((9.99999999739E8) < (var_1_16)) ? (9.99999999739E8) : (var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L71] COND FALSE !(var_1_2 || (var_1_16 <= var_1_16)) [L78] var_1_29 = (var_1_4 + (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) + var_1_5)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L80] COND TRUE var_1_2 || (var_1_17 <= (var_1_5 / var_1_3)) [L81] var_1_37 = (var_1_39 || var_1_40) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L83] COND FALSE !((var_1_4 + ((((var_1_10) < (var_1_3)) ? (var_1_10) : (var_1_3)))) <= var_1_4) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L88] signed long int stepLocal_0 = 64 + (var_1_5 / var_1_3); VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_0=65, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L89] COND TRUE stepLocal_0 != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6)) [L90] var_1_6 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100, var_1_9=1023/4] [L94] COND FALSE !(\read(var_1_2)) [L97] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100, var_1_9=1023/4] [L99] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L100] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_15=65/8, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L104] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L105] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L108] COND FALSE !(var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) [L111] var_1_17 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=63/2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L114] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) [L119] var_1_18 = var_1_16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L121] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_1=0, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=100] [L122] COND TRUE (var_1_17 + var_1_6) >= stepLocal_1 [L123] var_1_8 = ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=127] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=127] [L168-L169] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-129, var_1_6=769, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 216 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 19 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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 02:39:42,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-ps-ci_file-20.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 e4d8b25be12ac7c0f83971829851a1917a680012c727d89f67306d428382fca6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:39:44,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:39:44,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:39:44,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:39:44,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:39:44,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:39:44,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:39:44,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:39:44,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:39:44,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:39:44,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:39:44,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:39:44,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:39:44,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:39:44,439 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:39:44,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:39:44,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:39:44,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:39:44,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:39:44,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:39:44,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:39:44,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:39:44,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:39:44,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:39:44,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:39:44,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:39:44,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:39:44,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:39:44,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:39:44,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:39:44,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:39:44,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:39:44,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:39:44,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:39:44,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:39:44,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:39:44,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:39:44,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:39:44,447 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:39:44,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:39:44,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:39:44,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:39:44,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:39:44,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:39:44,449 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:39:44,449 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 -> e4d8b25be12ac7c0f83971829851a1917a680012c727d89f67306d428382fca6 [2024-10-13 02:39:44,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:39:44,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:39:44,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:39:44,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:39:44,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:39:44,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:45,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:39:46,178 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:39:46,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:46,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607a1ec20/3ae1a784ace7499d926a5d7bf751e8d2/FLAGa2c069787 [2024-10-13 02:39:46,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607a1ec20/3ae1a784ace7499d926a5d7bf751e8d2 [2024-10-13 02:39:46,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:39:46,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:39:46,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:39:46,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:39:46,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:39:46,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bca3390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46, skipping insertion in model container [2024-10-13 02:39:46,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:39:46,375 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_fillercode_fillercodestructure_filler-ps-ci_file-20.i[919,932] [2024-10-13 02:39:46,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:39:46,459 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:39:46,468 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_fillercode_fillercodestructure_filler-ps-ci_file-20.i[919,932] [2024-10-13 02:39:46,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:39:46,561 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:39:46,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46 WrapperNode [2024-10-13 02:39:46,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:39:46,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:39:46,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:39:46,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:39:46,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,614 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-13 02:39:46,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:39:46,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:39:46,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:39:46,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:39:46,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,639 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 02:39:46,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:39:46,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:39:46,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:39:46,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:39:46,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (1/1) ... [2024-10-13 02:39:46,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:39:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:39:46,689 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 02:39:46,691 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 02:39:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:39:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:39:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:39:46,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:39:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:39:46,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:39:46,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:39:46,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:39:53,429 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:39:53,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:39:53,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:39:53,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:39:53,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:39:53 BoogieIcfgContainer [2024-10-13 02:39:53,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:39:53,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:39:53,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:39:53,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:39:53,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:39:46" (1/3) ... [2024-10-13 02:39:53,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa5a51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:39:53, skipping insertion in model container [2024-10-13 02:39:53,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:39:46" (2/3) ... [2024-10-13 02:39:53,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa5a51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:39:53, skipping insertion in model container [2024-10-13 02:39:53,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:39:53" (3/3) ... [2024-10-13 02:39:53,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-20.i [2024-10-13 02:39:53,517 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:39:53,517 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:39:53,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:39:53,576 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;@3bf5e964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:39:53,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:39:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:39:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 02:39:53,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:39:53,591 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:53,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:39:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:39:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1517671892, now seen corresponding path program 1 times [2024-10-13 02:39:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:39:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970923130] [2024-10-13 02:39:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:53,607 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 02:39:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:39:53,609 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 02:39:53,633 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 02:39:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:53,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:39:53,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:39:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-13 02:39:54,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:39:54,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:39:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970923130] [2024-10-13 02:39:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970923130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:39:54,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:39:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:39:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155058652] [2024-10-13 02:39:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:39:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:39:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:39:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:39:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:39:54,039 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 43 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 02:39:58,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:39:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:39:58,166 INFO L93 Difference]: Finished difference Result 129 states and 231 transitions. [2024-10-13 02:39:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:39:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2024-10-13 02:39:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:39:58,204 INFO L225 Difference]: With dead ends: 129 [2024-10-13 02:39:58,205 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 02:39:58,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 02:39:58,209 INFO L432 NwaCegarLoop]: 97 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, 97 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 02:39:58,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 02:39:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 02:39:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 02:39:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:39:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-10-13 02:39:58,244 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 136 [2024-10-13 02:39:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:39:58,245 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-10-13 02:39:58,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 02:39:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-10-13 02:39:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 02:39:58,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:39:58,247 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:39:58,259 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 02:39:58,448 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 02:39:58,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:39:58,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:39:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash -388318677, now seen corresponding path program 1 times [2024-10-13 02:39:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:39:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123239232] [2024-10-13 02:39:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:39:58,450 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 02:39:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:39:58,451 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 02:39:58,453 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 02:39:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:39:58,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:39:58,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:39:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 02:39:58,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:39:58,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:39:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123239232] [2024-10-13 02:39:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123239232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:39:58,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:39:58,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:39:58,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918205357] [2024-10-13 02:39:58,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:39:58,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:39:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:39:58,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:39:58,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:39:58,912 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:40:06,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 02:40:09,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 02:40:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:09,425 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2024-10-13 02:40:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:40:09,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-13 02:40:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:09,458 INFO L225 Difference]: With dead ends: 149 [2024-10-13 02:40:09,458 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 02:40:09,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:40:09,459 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:09,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 160 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-13 02:40:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 02:40:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2024-10-13 02:40:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:40:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-13 02:40:09,472 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 137 [2024-10-13 02:40:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:09,473 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-13 02:40:09,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:40:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-13 02:40:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 02:40:09,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:09,475 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:09,487 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 02:40:09,675 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 02:40:09,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1409387031, now seen corresponding path program 1 times [2024-10-13 02:40:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:40:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976593849] [2024-10-13 02:40:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:09,677 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 02:40:09,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:40:09,679 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 02:40:09,680 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 02:40:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:09,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:40:09,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:40:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 308 proven. 12 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-13 02:40:11,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:40:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 02:40:12,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:40:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976593849] [2024-10-13 02:40:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976593849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:40:12,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:40:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 02:40:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811125292] [2024-10-13 02:40:12,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:40:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:40:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:40:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:40:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:40:12,053 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 02:40:19,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 02:40:22,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 02:40:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:22,368 INFO L93 Difference]: Finished difference Result 139 states and 212 transitions. [2024-10-13 02:40:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:40:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 137 [2024-10-13 02:40:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:22,407 INFO L225 Difference]: With dead ends: 139 [2024-10-13 02:40:22,407 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 02:40:22,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:40:22,408 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 109 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:22,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 146 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2024-10-13 02:40:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 02:40:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2024-10-13 02:40:22,423 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), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:40:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-10-13 02:40:22,426 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 137 [2024-10-13 02:40:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:22,427 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-10-13 02:40:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 02:40:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-10-13 02:40:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 02:40:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:22,430 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:22,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 02:40:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:40:22,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1306896633, now seen corresponding path program 1 times [2024-10-13 02:40:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:40:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357708008] [2024-10-13 02:40:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:22,633 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 02:40:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:40:22,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:40:22,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:40:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:40:22,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:40:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 02:40:23,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:40:23,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:40:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357708008] [2024-10-13 02:40:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357708008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:40:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:40:23,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:40:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969351] [2024-10-13 02:40:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:40:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:40:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:40:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:40:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:40:23,031 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:40:27,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:40:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:27,218 INFO L93 Difference]: Finished difference Result 158 states and 238 transitions. [2024-10-13 02:40:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:40:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 138 [2024-10-13 02:40:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:27,265 INFO L225 Difference]: With dead ends: 158 [2024-10-13 02:40:27,265 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 02:40:27,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:40:27,267 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:27,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 174 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 02:40:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 02:40:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2024-10-13 02:40:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 02:40:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2024-10-13 02:40:27,280 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 138 [2024-10-13 02:40:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:27,282 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2024-10-13 02:40:27,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 02:40:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2024-10-13 02:40:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 02:40:27,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:27,283 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:27,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 02:40:27,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:40:27,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1886531234, now seen corresponding path program 1 times [2024-10-13 02:40:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:40:27,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719471123] [2024-10-13 02:40:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:27,485 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 02:40:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:40:27,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:40:27,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:40:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:28,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 02:40:28,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:01,987 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)