./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_codestructure_normal_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:17:22,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:17:22,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:17:22,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:17:22,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:17:22,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:17:22,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:17:22,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:17:22,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:17:22,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:17:22,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:17:22,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:17:22,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:17:22,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:17:22,670 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:17:22,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:17:22,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:17:22,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:17:22,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:17:22,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:17:22,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:17:22,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:17:22,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:17:22,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:17:22,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:17:22,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:17:22,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:17:22,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:17:22,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:17:22,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:17:22,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:17:22,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:17:22,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:17:22,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:17:22,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:17:22,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:17:22,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:17:22,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:17:22,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:17:22,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:17:22,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:17:22,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:17:22,682 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-clean/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-clean/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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2024-10-11 07:17:22,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:17:23,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:17:23,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:17:23,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:17:23,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:17:23,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-10-11 07:17:24,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:17:24,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:17:24,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-10-11 07:17:24,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b24c1aad/656f51121bf349f1a80c7a4e0dfb629e/FLAG10ea57733 [2024-10-11 07:17:24,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b24c1aad/656f51121bf349f1a80c7a4e0dfb629e [2024-10-11 07:17:24,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:17:24,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:17:24,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:17:24,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:17:24,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:17:24,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:24" (1/1) ... [2024-10-11 07:17:24,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38470cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:24, skipping insertion in model container [2024-10-11 07:17:24,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:24" (1/1) ... [2024-10-11 07:17:24,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:17:24,907 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_codestructure_normal_file-13.i[913,926] [2024-10-11 07:17:24,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:17:24,992 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:17:25,005 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_codestructure_normal_file-13.i[913,926] [2024-10-11 07:17:25,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:17:25,072 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:17:25,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25 WrapperNode [2024-10-11 07:17:25,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:17:25,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:17:25,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:17:25,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:17:25,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,132 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-11 07:17:25,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:17:25,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:17:25,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:17:25,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:17:25,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,167 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-11 07:17:25,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:17:25,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:17:25,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:17:25,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:17:25,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (1/1) ... [2024-10-11 07:17:25,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:17:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:17:25,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:17:25,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:17:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:17:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:17:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:17:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:17:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:17:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:17:25,420 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:17:25,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:17:25,861 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:17:25,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:17:25,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:17:25,896 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:17:25,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:25 BoogieIcfgContainer [2024-10-11 07:17:25,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:17:25,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:17:25,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:17:25,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:17:25,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:17:24" (1/3) ... [2024-10-11 07:17:25,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c7deed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:25, skipping insertion in model container [2024-10-11 07:17:25,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:25" (2/3) ... [2024-10-11 07:17:25,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c7deed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:25, skipping insertion in model container [2024-10-11 07:17:25,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:25" (3/3) ... [2024-10-11 07:17:25,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2024-10-11 07:17:25,920 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:17:25,921 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:17:25,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:17:25,989 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;@23718398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:17:25,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:17:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:17:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 07:17:26,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:26,011 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:26,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 975944324, now seen corresponding path program 1 times [2024-10-11 07:17:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:17:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69731506] [2024-10-11 07:17:26,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:17:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:17:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:17:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:17:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:17:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:17:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:17:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:17:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:17:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:17:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:17:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:17:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:17:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:17:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:17:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:17:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:17:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:17:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:17:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:17:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:17:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:17:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:17:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:17:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:17:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:17:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:17:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:17:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:17:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:17:26,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:17:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69731506] [2024-10-11 07:17:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69731506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:17:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:17:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:17:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759974846] [2024-10-11 07:17:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:17:26,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:17:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:17:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:17:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:17:26,614 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:17:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:17:26,671 INFO L93 Difference]: Finished difference Result 143 states and 256 transitions. [2024-10-11 07:17:26,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:17:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-10-11 07:17:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:17:26,688 INFO L225 Difference]: With dead ends: 143 [2024-10-11 07:17:26,688 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 07:17:26,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-11 07:17:26,698 INFO L432 NwaCegarLoop]: 106 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, 106 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-11 07:17:26,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:17:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 07:17:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 07:17:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:17:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-11 07:17:26,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 172 [2024-10-11 07:17:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:17:26,744 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-11 07:17:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:17:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-11 07:17:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 07:17:26,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:26,748 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:17:26,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1485182076, now seen corresponding path program 1 times [2024-10-11 07:17:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:17:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646272969] [2024-10-11 07:17:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:17:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:17:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:17:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:17:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:17:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:17:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:17:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:17:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:17:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:17:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:17:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:17:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:17:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:17:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:17:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:17:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:17:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:17:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:17:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:17:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:17:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:17:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:17:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:17:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:17:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:17:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:17:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:17:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:17:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:17:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:17:27,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646272969] [2024-10-11 07:17:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646272969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:17:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:17:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:17:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859939036] [2024-10-11 07:17:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:17:27,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:17:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:17:27,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:17:27,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:17:27,179 INFO L87 Difference]: Start difference. First operand 71 states and 109 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:17:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:17:27,246 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2024-10-11 07:17:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:17:27,251 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-11 07:17:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:17:27,254 INFO L225 Difference]: With dead ends: 180 [2024-10-11 07:17:27,254 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 07:17:27,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-11 07:17:27,259 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:17:27,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 252 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:17:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 07:17:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-10-11 07:17:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 07:17:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2024-10-11 07:17:27,293 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 172 [2024-10-11 07:17:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:17:27,295 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2024-10-11 07:17:27,296 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:17:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2024-10-11 07:17:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 07:17:27,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:27,300 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:27,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:17:27,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:27,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1743347514, now seen corresponding path program 1 times [2024-10-11 07:17:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:17:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492251331] [2024-10-11 07:17:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:17:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:17:27,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689018881] [2024-10-11 07:17:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:17:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:17:27,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:17:27,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:17:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:17:27,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:17:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:17:27,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:17:27,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:17:27,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:17:27,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:17:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:17:28,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:17:28,163 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:17:28,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:17:28 BoogieIcfgContainer [2024-10-11 07:17:28,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:17:28,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:17:28,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:17:28,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:17:28,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:25" (3/4) ... [2024-10-11 07:17:28,183 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:17:28,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:17:28,186 INFO L158 Benchmark]: Toolchain (without parser) took 3499.22ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 146.2MB in the beginning and 186.0MB in the end (delta: -39.9MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,186 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:17:28,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.96ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 130.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.65ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 126.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,187 INFO L158 Benchmark]: Boogie Preprocessor took 72.07ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 121.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,188 INFO L158 Benchmark]: RCFGBuilder took 690.51ms. Allocated memory is still 174.1MB. Free memory was 121.0MB in the beginning and 123.1MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,188 INFO L158 Benchmark]: TraceAbstraction took 2268.10ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 51.8MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,189 INFO L158 Benchmark]: Witness Printer took 18.25ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 51.8MB in the beginning and 186.0MB in the end (delta: -134.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-11 07:17:28,191 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.16ms. Allocated memory is still 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.96ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 130.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.65ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 126.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.07ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 121.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.51ms. Allocated memory is still 174.1MB. Free memory was 121.0MB in the beginning and 123.1MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2268.10ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 51.8MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 18.25ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 51.8MB in the beginning and 186.0MB in the end (delta: -134.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of shiftRight at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int var_1_2 = 256; [L24] signed long int var_1_3 = 500; [L25] signed char var_1_4 = 16; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 1; [L28] unsigned short int var_1_7 = 50; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 64; [L33] signed char var_1_12 = -10; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = -25; [L36] double var_1_15 = 64.875; [L37] unsigned long int var_1_16 = 1000000; [L38] double var_1_17 = 1.625; [L39] double var_1_18 = 32.2; [L40] double var_1_19 = 8.6; [L41] double var_1_20 = 10.5; [L42] signed short int var_1_21 = -64; [L43] unsigned char var_1_22 = 25; [L44] unsigned char var_1_23 = 0; [L45] unsigned long int var_1_24 = 5; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L105] var_1_9 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L106] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L108] var_1_10 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L114] var_1_13 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L117] var_1_14 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L120] var_1_16 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_16 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_16 <= 4294967295) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L129] var_1_20 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET updateVariables() [L144] CALL step() [L49] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L49] COND FALSE !((~ var_1_2) != (var_1_3 >> var_1_4)) [L56] var_1_1 = 100 VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] COND TRUE var_1_10 > var_1_8 [L62] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] COND FALSE !(var_1_4 > var_1_1) [L67] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L74] COND TRUE ((- var_1_11) < 8) || var_1_9 [L75] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L77] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L78] COND TRUE var_1_18 <= var_1_20 [L79] var_1_24 = ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L135-L136] return (((((((((~ var_1_2) != (var_1_3 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_8) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_8 % var_1_10) > var_1_16) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_23)) : 1)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=-193, var_1_12=58, var_1_13=31, var_1_14=27, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 358 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 258 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3024/3024 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-11 07:17:28,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:17:30,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:17:30,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:17:30,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:17:30,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:17:30,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:17:30,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:17:30,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:17:30,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:17:30,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:17:30,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:17:30,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:17:30,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:17:30,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:17:30,583 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:17:30,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:17:30,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:17:30,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:17:30,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:17:30,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:17:30,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:17:30,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:17:30,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:17:30,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:17:30,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:17:30,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:17:30,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:17:30,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:17:30,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:17:30,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:17:30,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:17:30,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:17:30,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:17:30,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:17:30,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:17:30,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:17:30,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:17:30,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:17:30,594 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:17:30,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:17:30,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:17:30,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:17:30,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:17:30,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:17:30,597 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:17:30,597 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-clean/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-clean/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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2024-10-11 07:17:30,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:17:30,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:17:30,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:17:30,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:17:30,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:17:30,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-10-11 07:17:32,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:17:32,836 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:17:32,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-10-11 07:17:32,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b292e8ae6/3552830ce4c04da99af91bfea4b03d1e/FLAG0ab770b81 [2024-10-11 07:17:33,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b292e8ae6/3552830ce4c04da99af91bfea4b03d1e [2024-10-11 07:17:33,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:17:33,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:17:33,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:17:33,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:17:33,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:17:33,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71365ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33, skipping insertion in model container [2024-10-11 07:17:33,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:17:33,412 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_codestructure_normal_file-13.i[913,926] [2024-10-11 07:17:33,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:17:33,517 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:17:33,531 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_codestructure_normal_file-13.i[913,926] [2024-10-11 07:17:33,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:17:33,606 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:17:33,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33 WrapperNode [2024-10-11 07:17:33,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:17:33,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:17:33,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:17:33,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:17:33,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,676 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-11 07:17:33,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:17:33,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:17:33,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:17:33,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:17:33,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,725 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-11 07:17:33,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:17:33,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:17:33,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:17:33,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:17:33,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (1/1) ... [2024-10-11 07:17:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:17:33,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:17:33,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:17:33,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:17:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:17:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:17:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:17:33,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:17:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:17:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:17:33,954 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:17:33,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:17:39,017 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:17:39,017 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:17:39,096 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:17:39,097 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:17:39,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:39 BoogieIcfgContainer [2024-10-11 07:17:39,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:17:39,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:17:39,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:17:39,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:17:39,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:17:33" (1/3) ... [2024-10-11 07:17:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d77b5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:39, skipping insertion in model container [2024-10-11 07:17:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:33" (2/3) ... [2024-10-11 07:17:39,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d77b5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:39, skipping insertion in model container [2024-10-11 07:17:39,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:39" (3/3) ... [2024-10-11 07:17:39,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2024-10-11 07:17:39,128 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:17:39,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:17:39,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:17:39,210 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;@7ef0bc22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:17:39,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:17:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:17:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:17:39,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:39,234 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:39,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:39,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash -974909423, now seen corresponding path program 1 times [2024-10-11 07:17:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:17:39,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027758221] [2024-10-11 07:17:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:39,258 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-11 07:17:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:17:39,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:17:39,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:17:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:39,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:17:39,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:17:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-11 07:17:39,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:17:39,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:17:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027758221] [2024-10-11 07:17:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027758221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:17:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:17:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:17:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693190111] [2024-10-11 07:17:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:17:39,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:17:39,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:17:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:17:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:17:39,785 INFO L87 Difference]: Start difference. First operand has 68 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:17:43,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:17:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:17:43,668 INFO L93 Difference]: Finished difference Result 133 states and 242 transitions. [2024-10-11 07:17:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:17:43,697 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 169 [2024-10-11 07:17:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:17:43,704 INFO L225 Difference]: With dead ends: 133 [2024-10-11 07:17:43,704 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 07:17:43,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-11 07:17:43,710 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:17:43,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 07:17:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 07:17:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 07:17:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:17:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-11 07:17:43,759 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 169 [2024-10-11 07:17:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:17:43,759 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-11 07:17:43,760 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:17:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-11 07:17:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:17:43,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:43,766 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:43,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:17:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:17:43,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:43,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 48281881, now seen corresponding path program 1 times [2024-10-11 07:17:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:17:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10415954] [2024-10-11 07:17:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:43,973 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-11 07:17:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:17:43,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:17:43,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:17:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:44,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:17:44,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:17:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 428 proven. 132 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-10-11 07:17:46,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:17:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:17:46,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:17:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10415954] [2024-10-11 07:17:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10415954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:17:46,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:17:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-10-11 07:17:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805626814] [2024-10-11 07:17:46,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:17:46,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:17:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:17:46,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:17:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:17:46,879 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-11 07:17:50,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:17:55,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:17:57,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:17:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:17:57,484 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2024-10-11 07:17:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 07:17:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 169 [2024-10-11 07:17:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:17:57,491 INFO L225 Difference]: With dead ends: 191 [2024-10-11 07:17:57,491 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 07:17:57,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2024-10-11 07:17:57,496 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 143 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:17:57,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 190 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 306 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2024-10-11 07:17:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 07:17:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2024-10-11 07:17:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 60 states have internal predecessors, (76), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:17:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-10-11 07:17:57,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 169 [2024-10-11 07:17:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:17:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-10-11 07:17:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-11 07:17:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-10-11 07:17:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:17:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:17:57,531 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:17:57,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:17:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 07:17:57,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:17:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:17:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash -761064745, now seen corresponding path program 1 times [2024-10-11 07:17:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:17:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725595390] [2024-10-11 07:17:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:17:57,734 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-11 07:17:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:17:57,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 07:17:57,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:17:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:17:58,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:17:58,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:17:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:17:58,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:17:58,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:17:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725595390] [2024-10-11 07:17:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725595390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:17:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:17:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:17:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734046471] [2024-10-11 07:17:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:17:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:17:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:17:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:17:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:17:58,128 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:18:02,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:18:03,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:18:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:18:04,039 INFO L93 Difference]: Finished difference Result 256 states and 368 transitions. [2024-10-11 07:18:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:18:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2024-10-11 07:18:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:18:04,045 INFO L225 Difference]: With dead ends: 256 [2024-10-11 07:18:04,045 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 07:18:04,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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-11 07:18:04,047 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:18:04,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 07:18:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 07:18:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-10-11 07:18:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 104 states have internal predecessors, (129), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 07:18:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 225 transitions. [2024-10-11 07:18:04,088 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 225 transitions. Word has length 169 [2024-10-11 07:18:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:18:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 225 transitions. [2024-10-11 07:18:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 07:18:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 225 transitions. [2024-10-11 07:18:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:18:04,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:18:04,097 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:18:04,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:18:04,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 07:18:04,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:18:04,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:18:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1154091755, now seen corresponding path program 1 times [2024-10-11 07:18:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:18:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236986195] [2024-10-11 07:18:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:18:04,300 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-11 07:18:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:18:04,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 07:18:04,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:18:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:18:04,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 07:18:04,658 INFO L278 TraceCheckSpWp]: Computing forward predicates...