./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:27:26,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:27:26,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:27:26,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:27:26,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:27:26,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:27:26,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:27:26,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:27:26,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:27:26,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:27:26,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:27:26,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:27:26,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:27:26,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:27:26,675 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:27:26,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:27:26,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:27:26,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:27:26,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:27:26,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:27:26,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:27:26,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:27:26,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:27:26,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:27:26,678 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2025-03-08 10:27:26,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:27:26,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:27:26,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:27:26,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:27:26,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:27:26,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:28,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007ca4ee4/0a67aca31b3e4d1298c2e113aad00aea/FLAGc81868ab2 [2025-03-08 10:27:28,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:27:28,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:28,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007ca4ee4/0a67aca31b3e4d1298c2e113aad00aea/FLAGc81868ab2 [2025-03-08 10:27:28,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007ca4ee4/0a67aca31b3e4d1298c2e113aad00aea [2025-03-08 10:27:28,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:27:28,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:27:28,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:27:28,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:27:28,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:27:28,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477ae7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28, skipping insertion in model container [2025-03-08 10:27:28,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:27:28,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i[913,926] [2025-03-08 10:27:28,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:27:28,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:27:28,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i[913,926] [2025-03-08 10:27:28,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:27:28,770 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:27:28,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28 WrapperNode [2025-03-08 10:27:28,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:27:28,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:27:28,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:27:28,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:27:28,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,809 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-08 10:27:28,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:27:28,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:27:28,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:27:28,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:27:28,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:27:28,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:27:28,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:27:28,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:27:28,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:27:28,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (1/1) ... [2025-03-08 10:27:28,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:27:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:27:28,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:27:28,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:27:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:27:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:27:28,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:27:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:27:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:27:28,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:27:28,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:27:28,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:27:29,210 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-08 10:27:29,243 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 10:27:29,243 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:27:29,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:27:29,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:27:29,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:27:29 BoogieIcfgContainer [2025-03-08 10:27:29,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:27:29,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:27:29,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:27:29,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:27:29,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:27:28" (1/3) ... [2025-03-08 10:27:29,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6455b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:27:29, skipping insertion in model container [2025-03-08 10:27:29,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:28" (2/3) ... [2025-03-08 10:27:29,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6455b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:27:29, skipping insertion in model container [2025-03-08 10:27:29,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:27:29" (3/3) ... [2025-03-08 10:27:29,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:29,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:27:29,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-67.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:27:29,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:27:29,327 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;@66215edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:27:29,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:27:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:27:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 10:27:29,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:29,338 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:29,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:29,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1140250449, now seen corresponding path program 1 times [2025-03-08 10:27:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:27:29,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464646580] [2025-03-08 10:27:29,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:27:29,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 10:27:29,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 10:27:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 10:27:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:27:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464646580] [2025-03-08 10:27:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464646580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:27:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641354930] [2025-03-08 10:27:29,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:29,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:27:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:27:29,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:27:29,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:27:29,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 10:27:29,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 10:27:29,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:27:29,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:27:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 10:27:29,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:27:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641354930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:27:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:27:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:27:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844195466] [2025-03-08 10:27:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:27:29,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:27:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:27:29,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:27:29,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:27:29,776 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:27:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:27:29,814 INFO L93 Difference]: Finished difference Result 150 states and 253 transitions. [2025-03-08 10:27:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:27:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-08 10:27:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:27:29,820 INFO L225 Difference]: With dead ends: 150 [2025-03-08 10:27:29,820 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 10:27:29,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:27:29,824 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:27:29,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:27:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 10:27:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 10:27:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:27:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-03-08 10:27:29,856 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 142 [2025-03-08 10:27:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:27:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-08 10:27:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:27:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-03-08 10:27:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 10:27:29,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:29,863 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:29,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:27:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:27:30,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1576461365, now seen corresponding path program 1 times [2025-03-08 10:27:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:27:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83878779] [2025-03-08 10:27:30,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:27:30,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 10:27:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 10:27:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:27:30,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:27:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83878779] [2025-03-08 10:27:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83878779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:27:30,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:27:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:27:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102791708] [2025-03-08 10:27:30,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:27:30,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:27:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:27:30,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:27:30,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:27:30,330 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:27:30,371 INFO L93 Difference]: Finished difference Result 219 states and 333 transitions. [2025-03-08 10:27:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:27:30,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 10:27:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:27:30,374 INFO L225 Difference]: With dead ends: 219 [2025-03-08 10:27:30,375 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 10:27:30,375 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-03-08 10:27:30,376 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 65 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:27:30,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:27:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 10:27:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-03-08 10:27:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:27:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 221 transitions. [2025-03-08 10:27:30,397 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 221 transitions. Word has length 142 [2025-03-08 10:27:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:27:30,397 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 221 transitions. [2025-03-08 10:27:30,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2025-03-08 10:27:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 10:27:30,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:30,399 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:30,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:27:30,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -911051468, now seen corresponding path program 1 times [2025-03-08 10:27:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:27:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953595175] [2025-03-08 10:27:30,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:27:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 10:27:30,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 10:27:30,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:30,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:27:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:27:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953595175] [2025-03-08 10:27:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953595175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:27:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:27:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:27:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211876955] [2025-03-08 10:27:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:27:30,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:27:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:27:30,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:27:30,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:27:30,695 INFO L87 Difference]: Start difference. First operand 145 states and 221 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:27:30,849 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2025-03-08 10:27:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:27:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-08 10:27:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:27:30,853 INFO L225 Difference]: With dead ends: 384 [2025-03-08 10:27:30,853 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 10:27:30,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:27:30,855 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:27:30,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 306 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:27:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 10:27:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 200. [2025-03-08 10:27:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 130 states have internal predecessors, (171), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:27:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2025-03-08 10:27:30,884 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 142 [2025-03-08 10:27:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:27:30,886 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2025-03-08 10:27:30,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2025-03-08 10:27:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 10:27:30,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:30,888 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:27:30,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:30,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 910526767, now seen corresponding path program 1 times [2025-03-08 10:27:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:27:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648324082] [2025-03-08 10:27:30,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:27:30,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 10:27:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 10:27:31,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:27:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793723724] [2025-03-08 10:27:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:31,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:27:31,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:27:31,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:27:31,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:27:31,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 10:27:31,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 10:27:31,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:27:31,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:27:31,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 10:27:31,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 10:27:31,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:27:31,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:27:31,264 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:27:31,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:27:31,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:27:31,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 10:27:31,469 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 10:27:31,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:27:31,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:27:31 BoogieIcfgContainer [2025-03-08 10:27:31,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:27:31,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:27:31,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:27:31,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:27:31,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:27:29" (3/4) ... [2025-03-08 10:27:31,550 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:27:31,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:27:31,551 INFO L158 Benchmark]: Toolchain (without parser) took 2961.64ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 127.4MB in the end (delta: 6.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2025-03-08 10:27:31,552 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:27:31,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 119.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:27:31,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.77ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 115.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:27:31,554 INFO L158 Benchmark]: Boogie Preprocessor took 47.35ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 112.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:27:31,555 INFO L158 Benchmark]: IcfgBuilder took 403.16ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 86.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:27:31,555 INFO L158 Benchmark]: TraceAbstraction took 2284.12ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 127.6MB in the end (delta: -41.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-03-08 10:27:31,555 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 127.4MB in the end (delta: 224.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:27:31,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 119.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.77ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 115.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.35ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 112.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 403.16ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 86.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2284.12ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 127.6MB in the end (delta: -41.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 127.4MB in the end (delta: 224.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 25; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 7.5; [L27] signed long int var_1_8 = -1000; [L28] float var_1_9 = 9.25; [L29] float var_1_10 = 64.5; [L30] float var_1_11 = 16.25; [L31] signed char var_1_12 = 2; [L32] signed char var_1_13 = 8; [L33] signed char var_1_14 = 0; [L34] float var_1_15 = 0.6; [L35] signed char var_1_16 = 32; [L36] unsigned short int var_1_17 = 2; [L37] unsigned short int var_1_19 = 63241; [L38] unsigned short int var_1_20 = 58697; [L39] unsigned short int var_1_21 = 25516; [L40] unsigned long int var_1_22 = 3301682525; [L41] double last_1_var_1_1 = 9.75; [L42] unsigned char last_1_var_1_3 = 1; [L43] float last_1_var_1_7 = 7.5; [L44] signed char last_1_var_1_12 = 2; [L45] float last_1_var_1_15 = 0.6; [L46] unsigned short int last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=25, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L131] last_1_var_1_1 = var_1_1 [L132] last_1_var_1_3 = var_1_3 [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_12 = var_1_12 [L135] last_1_var_1_15 = var_1_15 [L136] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=25, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L146] RET updateLastVariables() [L147] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] var_1_6 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L101] var_1_8 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L104] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L104] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L105] var_1_9 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L107] var_1_10 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L108] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L109] var_1_11 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L110] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L111] var_1_13 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L112] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L113] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L113] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L114] var_1_14 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L115] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L116] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L116] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L117] var_1_19 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L118] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L119] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L119] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L120] var_1_20 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L121] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L122] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L122] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L123] var_1_21 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L124] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L125] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L125] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L126] var_1_22 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L127] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L128] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L128] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L147] RET updateVariables() [L148] CALL step() [L50] EXPR ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L50] signed long int stepLocal_2 = ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12; [L51] COND FALSE !(last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L60] unsigned long int stepLocal_3 = var_1_22 - var_1_20; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L61] COND TRUE \read(last_1_var_1_3) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L62] COND TRUE \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L63] COND TRUE \read(last_1_var_1_3) [L64] var_1_17 = var_1_14 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L78] var_1_3 = (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L79] COND TRUE 50 != var_1_16 [L80] var_1_1 = (1.00000000000025E12 - 24.25) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131] [L82] var_1_12 = (var_1_13 - var_1_14) [L83] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L84] unsigned char stepLocal_1 = var_1_3; [L85] signed long int stepLocal_0 = (var_1_16 + 100) / var_1_8; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L86] COND FALSE !(stepLocal_0 >= var_1_17) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_1=1, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L139-L140] return (((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (last_1_var_1_3 ? (var_1_6 ? (last_1_var_1_3 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((last_1_var_1_1 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 140 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 323 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 44 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3654/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:27:31,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:27:33,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:27:33,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:27:33,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:27:33,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:27:33,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:27:33,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:27:33,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:27:33,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:27:33,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:27:33,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:27:33,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:27:33,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:27:33,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:27:33,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:27:33,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:27:33,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:27:33,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:27:33,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:27:33,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:27:33,542 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2025-03-08 10:27:33,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:27:33,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:27:33,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:27:33,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:27:33,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:27:33,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:34,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c590cb65/965eb3c6d93f4040955121f6914b2d86/FLAG4284678c4 [2025-03-08 10:27:35,205 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:27:35,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:35,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c590cb65/965eb3c6d93f4040955121f6914b2d86/FLAG4284678c4 [2025-03-08 10:27:35,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c590cb65/965eb3c6d93f4040955121f6914b2d86 [2025-03-08 10:27:35,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:27:35,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:27:35,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:27:35,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:27:35,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:27:35,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1202a6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35, skipping insertion in model container [2025-03-08 10:27:35,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:27:35,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i[913,926] [2025-03-08 10:27:35,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:27:35,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:27:35,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-67.i[913,926] [2025-03-08 10:27:35,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:27:35,783 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:27:35,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35 WrapperNode [2025-03-08 10:27:35,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:27:35,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:27:35,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:27:35,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:27:35,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,820 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-08 10:27:35,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:27:35,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:27:35,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:27:35,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:27:35,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:27:35,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:27:35,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:27:35,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:27:35,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:27:35,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (1/1) ... [2025-03-08 10:27:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:27:35,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:27:35,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:27:35,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:27:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:27:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:27:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:27:35,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:27:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:27:35,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:27:35,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:27:35,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:27:37,176 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:27:37,177 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:27:37,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:27:37,183 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:27:37,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:27:37 BoogieIcfgContainer [2025-03-08 10:27:37,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:27:37,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:27:37,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:27:37,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:27:37,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:27:35" (1/3) ... [2025-03-08 10:27:37,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1660d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:27:37, skipping insertion in model container [2025-03-08 10:27:37,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:27:35" (2/3) ... [2025-03-08 10:27:37,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1660d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:27:37, skipping insertion in model container [2025-03-08 10:27:37,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:27:37" (3/3) ... [2025-03-08 10:27:37,190 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-67.i [2025-03-08 10:27:37,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:27:37,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-67.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:27:37,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:27:37,246 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@695f8af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:27:37,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:27:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:27:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 10:27:37,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:37,260 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:37,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1000577336, now seen corresponding path program 1 times [2025-03-08 10:27:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:27:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952081349] [2025-03-08 10:27:37,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:27:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:27:37,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:27:37,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:27:37,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 10:27:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 10:27:37,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:37,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:37,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:27:37,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:27:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 10:27:37,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:27:37,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:27:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952081349] [2025-03-08 10:27:37,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952081349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:27:37,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:27:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:27:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795034463] [2025-03-08 10:27:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:27:37,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:27:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:27:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:27:37,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:27:37,641 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:27:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:27:37,661 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2025-03-08 10:27:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:27:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2025-03-08 10:27:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:27:37,667 INFO L225 Difference]: With dead ends: 126 [2025-03-08 10:27:37,667 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 10:27:37,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:27:37,672 INFO L435 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:27:37,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:27:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 10:27:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 10:27:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:27:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-08 10:27:37,707 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 138 [2025-03-08 10:27:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:27:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-08 10:27:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:27:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-08 10:27:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 10:27:37,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:37,712 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:37,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:27:37,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:27:37,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:37,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash -883574756, now seen corresponding path program 1 times [2025-03-08 10:27:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:27:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690206842] [2025-03-08 10:27:37,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:27:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:27:37,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:27:37,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:27:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 10:27:38,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 10:27:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:38,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 10:27:38,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:27:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:27:38,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:27:38,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:27:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690206842] [2025-03-08 10:27:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690206842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:27:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:27:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:27:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609726167] [2025-03-08 10:27:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:27:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:27:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:27:38,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:27:38,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:27:38,623 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:40,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:27:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:27:40,480 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2025-03-08 10:27:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:27:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2025-03-08 10:27:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:27:40,500 INFO L225 Difference]: With dead ends: 184 [2025-03-08 10:27:40,500 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 10:27:40,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:27:40,501 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:27:40,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 262 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 10:27:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 10:27:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2025-03-08 10:27:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:27:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2025-03-08 10:27:40,522 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 138 [2025-03-08 10:27:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:27:40,522 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2025-03-08 10:27:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:27:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2025-03-08 10:27:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 10:27:40,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:27:40,524 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:27:40,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:27:40,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:27:40,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:27:40,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:27:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash -154477673, now seen corresponding path program 1 times [2025-03-08 10:27:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:27:40,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306212029] [2025-03-08 10:27:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:27:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:27:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:27:40,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:27:40,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:27:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 10:27:40,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 10:27:40,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:27:40,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:27:40,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 10:27:40,982 INFO L279 TraceCheckSpWp]: Computing forward predicates...