./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:21:15,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:21:15,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:21:15,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:21:15,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:21:15,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:21:15,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:21:15,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:21:15,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:21:15,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:21:15,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:21:15,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:21:15,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:21:15,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:21:15,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:21:15,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:15,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:21:15,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:15,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:21:15,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:21:15,143 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2025-01-09 12:21:15,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:21:15,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:21:15,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:21:15,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:21:15,406 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:21:15,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:16,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1718813/8171b70edbb24aaabe1d497b64690e41/FLAGe3a19b521 [2025-01-09 12:21:16,852 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:21:16,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:16,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1718813/8171b70edbb24aaabe1d497b64690e41/FLAGe3a19b521 [2025-01-09 12:21:16,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f1718813/8171b70edbb24aaabe1d497b64690e41 [2025-01-09 12:21:16,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:21:16,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:21:16,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:21:16,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:21:16,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:21:16,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:16" (1/1) ... [2025-01-09 12:21:16,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:16, skipping insertion in model container [2025-01-09 12:21:16,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:16" (1/1) ... [2025-01-09 12:21:16,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:21:17,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i[913,926] [2025-01-09 12:21:17,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:21:17,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:21:17,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i[913,926] [2025-01-09 12:21:17,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:21:17,180 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:21:17,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17 WrapperNode [2025-01-09 12:21:17,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:21:17,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:21:17,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:21:17,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:21:17,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,242 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-01-09 12:21:17,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:21:17,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:21:17,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:21:17,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:21:17,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:21:17,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:21:17,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:21:17,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:21:17,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:21:17,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (1/1) ... [2025-01-09 12:21:17,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:21:17,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:21:17,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:21:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:21:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:21:17,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:21:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:21:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:21:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:21:17,440 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:21:17,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:21:17,793 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 12:21:17,793 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:21:17,806 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:21:17,807 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:21:17,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:17 BoogieIcfgContainer [2025-01-09 12:21:17,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:21:17,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:21:17,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:21:17,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:21:17,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:21:16" (1/3) ... [2025-01-09 12:21:17,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:17, skipping insertion in model container [2025-01-09 12:21:17,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:17" (2/3) ... [2025-01-09 12:21:17,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdb6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:17, skipping insertion in model container [2025-01-09 12:21:17,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:17" (3/3) ... [2025-01-09 12:21:17,818 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:17,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:21:17,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-67.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:21:17,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:21:17,897 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;@4a73e945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:21:17,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:21:17,901 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-01-09 12:21:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:21:17,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:17,911 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-01-09 12:21:17,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:17,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash 780798938, now seen corresponding path program 1 times [2025-01-09 12:21:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:21:17,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857936818] [2025-01-09 12:21:17,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:21:18,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:21:18,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:21:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:21:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:21:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857936818] [2025-01-09 12:21:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857936818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:21:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926117528] [2025-01-09 12:21:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:21:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:21:18,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:21:18,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:21:18,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:21:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:21:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:18,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:21:18,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:21:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:21:18,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:21:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926117528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:18,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:21:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:21:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714289678] [2025-01-09 12:21:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:21:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:21:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:21:18,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:21:18,499 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-01-09 12:21:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:18,530 INFO L93 Difference]: Finished difference Result 150 states and 253 transitions. [2025-01-09 12:21:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:21:18,531 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-01-09 12:21:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:18,537 INFO L225 Difference]: With dead ends: 150 [2025-01-09 12:21:18,538 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 12:21:18,542 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-01-09 12:21:18,545 INFO L435 NwaCegarLoop]: 113 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, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:21:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 12:21:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 12:21:18,581 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-01-09 12:21:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-01-09 12:21:18,589 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 142 [2025-01-09 12:21:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:18,589 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-01-09 12:21:18,590 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-01-09 12:21:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-01-09 12:21:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:21:18,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:18,592 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-01-09 12:21:18,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:21:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:21:18,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:18,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1653220770, now seen corresponding path program 1 times [2025-01-09 12:21:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:21:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556902593] [2025-01-09 12:21:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:21:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:21:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:21:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:21:19,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:21:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556902593] [2025-01-09 12:21:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556902593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:19,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:21:19,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:21:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365112925] [2025-01-09 12:21:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:19,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:21:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:21:19,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:21:19,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:21:19,100 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-01-09 12:21:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:19,152 INFO L93 Difference]: Finished difference Result 219 states and 333 transitions. [2025-01-09 12:21:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:21:19,152 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-01-09 12:21:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:19,155 INFO L225 Difference]: With dead ends: 219 [2025-01-09 12:21:19,155 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 12:21:19,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:21:19,156 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:19,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:21:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 12:21:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-01-09 12:21:19,186 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-01-09 12:21:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 221 transitions. [2025-01-09 12:21:19,192 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 221 transitions. Word has length 142 [2025-01-09 12:21:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:19,193 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 221 transitions. [2025-01-09 12:21:19,193 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-01-09 12:21:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2025-01-09 12:21:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:21:19,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:19,198 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-01-09 12:21:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:21:19,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 973162400, now seen corresponding path program 1 times [2025-01-09 12:21:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:21:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457935807] [2025-01-09 12:21:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:21:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:21:19,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:21:19,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:19,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:21:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:21:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457935807] [2025-01-09 12:21:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457935807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:19,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:21:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:21:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779818714] [2025-01-09 12:21:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:21:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:21:19,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:21:19,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:21:19,575 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-01-09 12:21:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:19,786 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2025-01-09 12:21:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:21:19,789 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-01-09 12:21:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:19,794 INFO L225 Difference]: With dead ends: 384 [2025-01-09 12:21:19,794 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 12:21:19,796 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-01-09 12:21:19,796 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:19,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 312 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:21:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 12:21:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 200. [2025-01-09 12:21:19,840 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-01-09 12:21:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2025-01-09 12:21:19,843 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 142 [2025-01-09 12:21:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:19,844 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2025-01-09 12:21:19,844 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-01-09 12:21:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2025-01-09 12:21:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 12:21:19,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:19,846 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-01-09 12:21:19,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:21:19,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:19,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1591762538, now seen corresponding path program 1 times [2025-01-09 12:21:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:21:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627136708] [2025-01-09 12:21:19,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:21:19,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 12:21:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 12:21:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:21:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779081139] [2025-01-09 12:21:20,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:21:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:21:20,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:21:20,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:21:20,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 12:21:20,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 12:21:20,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:21:20,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:21:20,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 12:21:20,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 12:21:20,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:21:20,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:21:20,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:21:20,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:21:20,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:21:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:21:20,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 12:21:20,619 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:21:20,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:21:20 BoogieIcfgContainer [2025-01-09 12:21:20,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:21:20,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:21:20,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:21:20,626 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:21:20,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:17" (3/4) ... [2025-01-09 12:21:20,630 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:21:20,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:21:20,631 INFO L158 Benchmark]: Toolchain (without parser) took 3752.34ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 51.5MB in the end (delta: 55.2MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-01-09 12:21:20,633 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:21:20,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.79ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:21:20,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.20ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:21:20,635 INFO L158 Benchmark]: Boogie Preprocessor took 71.51ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:21:20,635 INFO L158 Benchmark]: RCFGBuilder took 492.86ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 61.1MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:21:20,636 INFO L158 Benchmark]: TraceAbstraction took 2814.74ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 51.6MB in the end (delta: 8.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2025-01-09 12:21:20,637 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:21:20,638 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.68ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.79ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 91.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.20ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.51ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 492.86ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 61.1MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2814.74ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 51.6MB in the end (delta: 8.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 110, 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() [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=133, 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=133, 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=133, 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=133, 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=133, 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=133, 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=133, 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=133, 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=133, 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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, 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=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [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=0, stepLocal_1=1, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=2, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, 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=-2147516416, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=2, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, 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=1, var_1_13=2, var_1_14=1, var_1_15=2, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, 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=1, var_1_13=2, var_1_14=1, var_1_15=2, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, 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=1, var_1_13=2, var_1_14=1, var_1_15=2, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=-2147483649, var_1_3=1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 637 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 329 mSDtfsCounter, 31 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.7s 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-01-09 12:21:20,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:21:22,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:21:23,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:21:23,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:21:23,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:21:23,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:21:23,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:21:23,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:21:23,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:21:23,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:21:23,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:21:23,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:21:23,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:21:23,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:21:23,104 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:21:23,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:21:23,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:21:23,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:21:23,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:21:23,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:21:23,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:21:23,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:23,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:21:23,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:23,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:21:23,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2025-01-09 12:21:23,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:21:23,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:21:23,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:21:23,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:21:23,429 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:21:23,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:24,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bd860ba/0f5750a1a85c4dc182ebae08e81cd04d/FLAGd4f273a8a [2025-01-09 12:21:24,934 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:21:24,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:24,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bd860ba/0f5750a1a85c4dc182ebae08e81cd04d/FLAGd4f273a8a [2025-01-09 12:21:24,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bd860ba/0f5750a1a85c4dc182ebae08e81cd04d [2025-01-09 12:21:24,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:21:24,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:21:24,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:21:24,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:21:24,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:21:24,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:24" (1/1) ... [2025-01-09 12:21:24,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3c6781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:24, skipping insertion in model container [2025-01-09 12:21:24,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:24" (1/1) ... [2025-01-09 12:21:25,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:21:25,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i[913,926] [2025-01-09 12:21:25,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:21:25,220 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:21:25,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i[913,926] [2025-01-09 12:21:25,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:21:25,279 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:21:25,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25 WrapperNode [2025-01-09 12:21:25,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:21:25,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:21:25,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:21:25,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:21:25,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,326 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 12:21:25,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:21:25,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:21:25,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:21:25,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:21:25,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,375 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:21:25,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:21:25,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:21:25,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:21:25,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:21:25,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (1/1) ... [2025-01-09 12:21:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:21:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:21:25,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:21:25,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:21:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:21:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:21:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:21:25,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:21:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:21:25,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:21:25,541 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:21:25,543 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:21:26,342 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:21:26,342 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:21:26,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:21:26,351 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:21:26,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:26 BoogieIcfgContainer [2025-01-09 12:21:26,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:21:26,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:21:26,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:21:26,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:21:26,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:21:24" (1/3) ... [2025-01-09 12:21:26,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6326c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:26, skipping insertion in model container [2025-01-09 12:21:26,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:25" (2/3) ... [2025-01-09 12:21:26,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6326c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:26, skipping insertion in model container [2025-01-09 12:21:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:26" (3/3) ... [2025-01-09 12:21:26,363 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-67.i [2025-01-09 12:21:26,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:21:26,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-67.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:21:26,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:21:26,444 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;@74408ffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:21:26,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:21:26,448 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-01-09 12:21:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 12:21:26,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:26,460 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-01-09 12:21:26,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:26,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -192996580, now seen corresponding path program 1 times [2025-01-09 12:21:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:21:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508941600] [2025-01-09 12:21:26,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:26,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:21:26,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:21:26,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:21:26,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:21:26,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 12:21:26,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 12:21:26,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:26,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:21:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:21:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 12:21:26,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:21:26,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:21:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508941600] [2025-01-09 12:21:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508941600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:26,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:21:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:21:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885275135] [2025-01-09 12:21:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:26,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:21:26,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:21:26,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:21:26,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:21:26,868 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-01-09 12:21:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:26,896 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2025-01-09 12:21:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:21:26,898 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-01-09 12:21:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:26,906 INFO L225 Difference]: With dead ends: 126 [2025-01-09 12:21:26,906 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 12:21:26,910 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-01-09 12:21:26,912 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-01-09 12:21:26,912 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-01-09 12:21:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 12:21:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 12:21:26,941 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-01-09 12:21:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-01-09 12:21:26,946 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 138 [2025-01-09 12:21:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:26,946 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-01-09 12:21:26,946 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-01-09 12:21:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-01-09 12:21:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 12:21:26,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:26,952 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-01-09 12:21:26,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 12:21:27,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:21:27,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 333666532, now seen corresponding path program 1 times [2025-01-09 12:21:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:21:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616076331] [2025-01-09 12:21:27,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:27,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:21:27,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:21:27,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:21:27,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:21:27,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 12:21:27,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 12:21:27,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:27,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:21:27,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:21:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:21:28,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:21:28,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:21:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616076331] [2025-01-09 12:21:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616076331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:28,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:21:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:21:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246560356] [2025-01-09 12:21:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:21:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:21:28,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:21:28,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:21:28,203 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-01-09 12:21:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:29,993 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2025-01-09 12:21:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:21:30,010 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-01-09 12:21:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:30,012 INFO L225 Difference]: With dead ends: 184 [2025-01-09 12:21:30,012 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 12:21:30,013 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-01-09 12:21:30,014 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:30,014 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.7s Time] [2025-01-09 12:21:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 12:21:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2025-01-09 12:21:30,034 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-01-09 12:21:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2025-01-09 12:21:30,037 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 138 [2025-01-09 12:21:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2025-01-09 12:21:30,037 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-01-09 12:21:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2025-01-09 12:21:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:21:30,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:30,039 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-01-09 12:21:30,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:21:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:21:30,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1237245262, now seen corresponding path program 1 times [2025-01-09 12:21:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:21:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371422793] [2025-01-09 12:21:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:30,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:21:30,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:21:30,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:21:30,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:21:30,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:21:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:21:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:30,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 12:21:30,564 INFO L279 TraceCheckSpWp]: Computing forward predicates...