./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:06:50,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:06:50,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:06:50,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:06:50,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:06:50,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:06:50,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:06:50,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:06:50,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:06:50,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:06:50,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:06:50,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:06:50,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:06:50,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:06:50,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:06:50,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:50,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:50,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:50,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:06:50,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:06:50,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 [2025-01-09 11:06:50,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:06:50,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:06:50,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:06:50,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:06:50,370 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:06:50,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:06:51,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9512604/936d255265314f79842f51fa3634d981/FLAGb600a1b52 [2025-01-09 11:06:51,681 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:06:51,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:06:51,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9512604/936d255265314f79842f51fa3634d981/FLAGb600a1b52 [2025-01-09 11:06:51,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c9512604/936d255265314f79842f51fa3634d981 [2025-01-09 11:06:51,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:06:51,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:06:51,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:51,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:06:51,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:06:51,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a66225b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51, skipping insertion in model container [2025-01-09 11:06:51,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:06:51,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2025-01-09 11:06:51,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:51,843 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:06:51,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2025-01-09 11:06:51,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:51,888 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:06:51,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51 WrapperNode [2025-01-09 11:06:51,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:51,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:51,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:06:51,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:06:51,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,929 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2025-01-09 11:06:51,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:51,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:06:51,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:06:51,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:06:51,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,955 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:06:51,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:06:51,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:06:51,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:06:51,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:06:51,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (1/1) ... [2025-01-09 11:06:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:51,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:06:52,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:06:52,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:06:52,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:06:52,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:06:52,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:06:52,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:06:52,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:06:52,063 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:06:52,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:06:52,371 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 11:06:52,372 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:06:52,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:06:52,378 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:06:52,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:52 BoogieIcfgContainer [2025-01-09 11:06:52,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:06:52,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:06:52,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:06:52,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:06:52,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:06:51" (1/3) ... [2025-01-09 11:06:52,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:52, skipping insertion in model container [2025-01-09 11:06:52,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:51" (2/3) ... [2025-01-09 11:06:52,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:52, skipping insertion in model container [2025-01-09 11:06:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:52" (3/3) ... [2025-01-09 11:06:52,385 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:06:52,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:06:52,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:06:52,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:06:52,439 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;@14fea82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:06:52,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:06:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 11:06:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 11:06:52,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:52,455 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:52,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:52,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -10716495, now seen corresponding path program 1 times [2025-01-09 11:06:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809371796] [2025-01-09 11:06:52,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:52,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 11:06:52,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 11:06:52,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:52,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 11:06:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809371796] [2025-01-09 11:06:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809371796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:06:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960545268] [2025-01-09 11:06:52,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:52,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:52,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:06:52,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 11:06:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 11:06:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:52,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:06:52,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:06:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 11:06:53,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:06:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960545268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:53,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:06:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:06:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762505988] [2025-01-09 11:06:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:06:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:53,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:06:53,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:06:53,055 INFO L87 Difference]: Start difference. First operand has 97 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 11:06:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:53,077 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2025-01-09 11:06:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:06:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-01-09 11:06:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:53,083 INFO L225 Difference]: With dead ends: 184 [2025-01-09 11:06:53,083 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 11:06:53,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:06:53,088 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 11:06:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 11:06:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 11:06:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2025-01-09 11:06:53,123 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 190 [2025-01-09 11:06:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:53,123 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2025-01-09 11:06:53,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 11:06:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2025-01-09 11:06:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 11:06:53,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:53,130 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:53,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:06:53,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:06:53,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:53,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2046118921, now seen corresponding path program 1 times [2025-01-09 11:06:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257450611] [2025-01-09 11:06:53,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:53,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 11:06:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 11:06:53,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:53,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:06:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257450611] [2025-01-09 11:06:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257450611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:06:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889011553] [2025-01-09 11:06:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:53,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:06:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:53,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:06:53,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:53,537 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:53,619 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2025-01-09 11:06:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:06:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-01-09 11:06:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:53,622 INFO L225 Difference]: With dead ends: 227 [2025-01-09 11:06:53,622 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 11:06:53,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:53,623 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 70 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:53,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 277 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 11:06:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-01-09 11:06:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 97 states have internal predecessors, (133), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 11:06:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2025-01-09 11:06:53,645 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 190 [2025-01-09 11:06:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:53,646 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2025-01-09 11:06:53,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2025-01-09 11:06:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 11:06:53,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:53,648 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:06:53,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:53,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 443410041, now seen corresponding path program 1 times [2025-01-09 11:06:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-01-09 11:06:53,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:53,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 11:06:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 11:06:53,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:53,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:06:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-01-09 11:06:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:06:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678480291] [2025-01-09 11:06:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:06:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:53,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:06:53,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:53,928 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:53,997 INFO L93 Difference]: Finished difference Result 271 states and 415 transitions. [2025-01-09 11:06:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:06:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-01-09 11:06:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:54,003 INFO L225 Difference]: With dead ends: 271 [2025-01-09 11:06:54,003 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 11:06:54,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:54,004 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:54,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 11:06:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 11:06:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 97 states have internal predecessors, (131), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 11:06:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2025-01-09 11:06:54,031 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 190 [2025-01-09 11:06:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:54,032 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2025-01-09 11:06:54,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2025-01-09 11:06:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 11:06:54,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:54,038 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:06:54,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:54,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1746496246, now seen corresponding path program 1 times [2025-01-09 11:06:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-01-09 11:06:54,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:54,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 11:06:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 11:06:54,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:54,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:06:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-01-09 11:06:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110036482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:54,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:06:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591840542] [2025-01-09 11:06:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:06:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:54,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:06:54,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:54,208 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:54,246 INFO L93 Difference]: Finished difference Result 354 states and 537 transitions. [2025-01-09 11:06:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:06:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-01-09 11:06:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:54,248 INFO L225 Difference]: With dead ends: 354 [2025-01-09 11:06:54,248 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 11:06:54,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:54,249 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 48 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:54,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 11:06:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2025-01-09 11:06:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 141 states have internal predecessors, (184), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 11:06:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 318 transitions. [2025-01-09 11:06:54,306 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 318 transitions. Word has length 191 [2025-01-09 11:06:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:54,306 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 318 transitions. [2025-01-09 11:06:54,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 318 transitions. [2025-01-09 11:06:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 11:06:54,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:54,310 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:06:54,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:54,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -700740618, now seen corresponding path program 1 times [2025-01-09 11:06:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815945763] [2025-01-09 11:06:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:54,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 11:06:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 11:06:54,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:54,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:06:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:54,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815945763] [2025-01-09 11:06:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:54,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:06:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510820714] [2025-01-09 11:06:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:54,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:06:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:54,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:06:54,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:54,477 INFO L87 Difference]: Start difference. First operand 212 states and 318 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:54,610 INFO L93 Difference]: Finished difference Result 356 states and 531 transitions. [2025-01-09 11:06:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:06:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-01-09 11:06:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:54,613 INFO L225 Difference]: With dead ends: 356 [2025-01-09 11:06:54,614 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 11:06:54,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:54,616 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 83 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:54,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 282 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:06:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 11:06:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2025-01-09 11:06:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 11:06:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 282 transitions. [2025-01-09 11:06:54,645 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 282 transitions. Word has length 191 [2025-01-09 11:06:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:54,646 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 282 transitions. [2025-01-09 11:06:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:06:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 282 transitions. [2025-01-09 11:06:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 11:06:54,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:54,650 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:06:54,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1510087244, now seen corresponding path program 1 times [2025-01-09 11:06:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748087427] [2025-01-09 11:06:54,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:54,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 11:06:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 11:06:54,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:54,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:06:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125499959] [2025-01-09 11:06:54,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:54,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:54,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:54,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:54,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:06:54,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 11:06:54,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 11:06:54,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:54,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:06:54,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:06:55,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 11:06:55,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 11:06:55,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:55,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:06:55,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:06:55,132 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:06:55,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:06:55,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:06:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:55,336 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 11:06:55,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:06:55,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:06:55 BoogieIcfgContainer [2025-01-09 11:06:55,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:06:55,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:06:55,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:06:55,436 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:06:55,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:52" (3/4) ... [2025-01-09 11:06:55,438 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:06:55,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:06:55,439 INFO L158 Benchmark]: Toolchain (without parser) took 3740.55ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 35.9MB in the end (delta: 79.3MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2025-01-09 11:06:55,440 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:06:55,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 99.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:06:55,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.62ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 95.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:06:55,440 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 91.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:06:55,440 INFO L158 Benchmark]: RCFGBuilder took 405.80ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 66.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:06:55,441 INFO L158 Benchmark]: TraceAbstraction took 3055.06ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 35.9MB in the end (delta: 29.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2025-01-09 11:06:55,441 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:06:55,442 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.19ms. Allocated memory is still 226.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 99.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.62ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 95.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 91.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 405.80ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 66.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3055.06ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 35.9MB in the end (delta: 29.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 93, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someUnaryDOUBLEoperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L40] unsigned long int var_1_24 = 256; [L41] unsigned char var_1_27 = 1; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] unsigned char var_1_31 = 1; [L45] double var_1_32 = 32.7; [L46] unsigned char var_1_34 = 1; [L47] unsigned long int var_1_35 = 1000; [L48] signed char var_1_39 = -32; [L49] signed char var_1_40 = 16; [L50] signed char var_1_41 = 4; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] float var_1_44 = 99999999999.2; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-25, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L179] isInitial = 1 [L180] FCALL initially() [L182] FCALL updateLastVariables() [L183] CALL updateVariables() [L126] var_1_3 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L127] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L130] var_1_4 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L131] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L134] var_1_6 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L135] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L136] var_1_7 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L137] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L138] var_1_8 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L139] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L141] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L143] var_1_11 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L144] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L145] var_1_12 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L146] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L147] var_1_20 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L148] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L150] var_1_21 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L151] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L153] var_1_23 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L154] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L156] var_1_29 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L157] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L162] var_1_40 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L163] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L165] var_1_41 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L166] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L169] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L183] RET updateVariables() [L184] CALL step() [L57] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L58] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L65] var_1_31 = var_1_30 [L66] var_1_34 = (! (var_1_10 && var_1_30)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L67] EXPR var_1_19 >> var_1_19 VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L67] COND FALSE !(((var_1_19 >> var_1_19) % -10) >= var_1_4) [L72] COND TRUE var_1_10 || var_1_20 [L73] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L75] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L80] COND TRUE var_1_13 <= 32u VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L81] COND TRUE var_1_13 < var_1_21 [L82] var_1_27 = (var_1_10 || (var_1_10 || var_1_29)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L91] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_1=21/4, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L92] COND TRUE var_1_19 > stepLocal_0 [L93] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L97] COND TRUE ! var_1_10 [L98] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L102] COND TRUE var_1_21 <= var_1_19 [L103] var_1_32 = (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) < 0 ) ? -((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) : ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L105] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L110] COND TRUE -32 >= var_1_13 [L111] var_1_39 = (((((5 + var_1_40)) > (var_1_41)) ? ((5 + var_1_40)) : (var_1_41))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L113] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L116] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L119] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L121] COND TRUE var_1_6 < ((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))) [L122] var_1_44 = (var_1_8 + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L175-L176] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=179, var_1_16=2, var_1_17=128, var_1_19=129, var_1_20=1, var_1_21=129, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 1077 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 719 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 9688/9744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 11:06:55,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:06:57,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:06:57,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:06:57,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:06:57,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:06:57,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:06:57,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:06:57,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:06:57,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:06:57,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:06:57,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:06:57,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:06:57,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:06:57,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:06:57,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:06:57,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:06:57,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:06:57,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:57,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:57,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:06:57,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:06:57,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:06:57,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:06:57,353 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:06:57,353 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:06:57,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:06:57,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:06:57,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:06:57,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:06:57,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 [2025-01-09 11:06:57,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:06:57,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:06:57,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:06:57,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:06:57,584 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:06:57,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:06:58,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cd80488c/5527c0ff43f74efaa46087b1b8c04142/FLAG9c85a2e36 [2025-01-09 11:06:58,976 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:06:58,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:06:58,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cd80488c/5527c0ff43f74efaa46087b1b8c04142/FLAG9c85a2e36 [2025-01-09 11:06:59,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cd80488c/5527c0ff43f74efaa46087b1b8c04142 [2025-01-09 11:06:59,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:06:59,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:06:59,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:59,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:06:59,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:06:59,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dbdbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59, skipping insertion in model container [2025-01-09 11:06:59,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:06:59,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2025-01-09 11:06:59,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:59,182 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:06:59,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2025-01-09 11:06:59,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:59,220 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:06:59,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59 WrapperNode [2025-01-09 11:06:59,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:59,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:59,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:06:59,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:06:59,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,258 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-01-09 11:06:59,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:59,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:06:59,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:06:59,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:06:59,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:06:59,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:06:59,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:06:59,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:06:59,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:06:59,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (1/1) ... [2025-01-09 11:06:59,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:59,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:06:59,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:06:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:06:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:06:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:06:59,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:06:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:06:59,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:06:59,415 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:06:59,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:07:26,155 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 11:07:26,155 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:07:26,163 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:07:26,164 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:07:26,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:07:26 BoogieIcfgContainer [2025-01-09 11:07:26,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:07:26,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:07:26,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:07:26,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:07:26,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:06:59" (1/3) ... [2025-01-09 11:07:26,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe68f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:07:26, skipping insertion in model container [2025-01-09 11:07:26,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:59" (2/3) ... [2025-01-09 11:07:26,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe68f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:07:26, skipping insertion in model container [2025-01-09 11:07:26,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:07:26" (3/3) ... [2025-01-09 11:07:26,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2025-01-09 11:07:26,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:07:26,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:07:26,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:07:26,228 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;@223f6f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:07:26,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:07:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 11:07:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:07:26,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:26,245 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:07:26,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1320631406, now seen corresponding path program 1 times [2025-01-09 11:07:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:26,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993552817] [2025-01-09 11:07:26,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:07:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:26,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:07:26,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 11:07:26,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:07:27,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:07:27,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:27,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:07:27,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-01-09 11:07:27,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:27,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993552817] [2025-01-09 11:07:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993552817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:07:27,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048709398] [2025-01-09 11:07:27,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:27,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:07:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:27,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:07:27,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:07:27,801 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 11:07:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:27,822 INFO L93 Difference]: Finished difference Result 162 states and 290 transitions. [2025-01-09 11:07:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:07:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-01-09 11:07:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:27,828 INFO L225 Difference]: With dead ends: 162 [2025-01-09 11:07:27,828 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 11:07:27,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:07:27,832 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:27,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:07:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 11:07:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 11:07:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 11:07:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2025-01-09 11:07:27,862 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 187 [2025-01-09 11:07:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2025-01-09 11:07:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 11:07:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2025-01-09 11:07:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:07:27,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:27,865 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:07:27,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 11:07:28,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:07:28,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:28,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1521026840, now seen corresponding path program 1 times [2025-01-09 11:07:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973591808] [2025-01-09 11:07:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:07:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:28,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:07:28,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 11:07:28,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:07:29,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:07:29,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:29,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:29,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:07:29,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:07:29,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:29,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:29,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973591808] [2025-01-09 11:07:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973591808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:29,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:07:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714990517] [2025-01-09 11:07:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:07:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:07:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:07:29,869 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:07:34,281 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 [] [2025-01-09 11:07:38,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:07:42,488 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 [] [2025-01-09 11:07:47,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:07:51,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:07:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:51,266 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-01-09 11:07:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:07:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 11:07:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:51,269 INFO L225 Difference]: With dead ends: 203 [2025-01-09 11:07:51,269 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 11:07:51,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:07:51,270 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:51,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 266 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 21.4s Time] [2025-01-09 11:07:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 11:07:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-01-09 11:07:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 11:07:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 191 transitions. [2025-01-09 11:07:51,310 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 191 transitions. Word has length 187 [2025-01-09 11:07:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:51,311 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 191 transitions. [2025-01-09 11:07:51,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:07:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2025-01-09 11:07:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:07:51,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:51,315 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:07:51,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 11:07:51,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:07:51,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -447084056, now seen corresponding path program 1 times [2025-01-09 11:07:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460260840] [2025-01-09 11:07:51,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:07:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:51,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:07:51,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 11:07:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:07:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:07:52,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:52,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:07:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 11:07:53,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:53,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:53,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460260840] [2025-01-09 11:07:53,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460260840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:53,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:07:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052711063] [2025-01-09 11:07:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:53,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:07:53,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:53,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:07:53,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:07:53,432 INFO L87 Difference]: Start difference. First operand 122 states and 191 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:07:57,839 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 [] [2025-01-09 11:08:01,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:05,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:09,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:13,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:13,599 INFO L93 Difference]: Finished difference Result 248 states and 384 transitions. [2025-01-09 11:08:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:08:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 11:08:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:13,762 INFO L225 Difference]: With dead ends: 248 [2025-01-09 11:08:13,762 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 11:08:13,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:08:13,763 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:13,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 251 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 20.1s Time] [2025-01-09 11:08:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 11:08:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2025-01-09 11:08:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 11:08:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-01-09 11:08:13,771 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 187 [2025-01-09 11:08:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:13,771 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-01-09 11:08:13,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 11:08:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-01-09 11:08:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:08:13,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:13,773 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:08:13,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 11:08:13,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:08:13,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1264732506, now seen corresponding path program 1 times [2025-01-09 11:08:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:08:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895707984] [2025-01-09 11:08:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:08:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:08:13,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:08:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 11:08:14,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:08:16,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:08:16,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:16,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:16,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 11:08:16,646 INFO L279 TraceCheckSpWp]: Computing forward predicates...