./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:34:04,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:34:04,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:34:04,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:34:04,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:34:04,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:34:04,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:34:04,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:34:04,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:34:04,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:34:04,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:34:04,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:34:04,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:34:04,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:34:04,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:34:04,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:34:04,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:04,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:34:04,883 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2025-03-03 21:34:05,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:34:05,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:34:05,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:34:05,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:34:05,120 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:34:05,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:34:06,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6f51698/aae1ad81838044809484d6fb2750d48d/FLAG129fc7d39 [2025-03-03 21:34:06,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:34:06,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:34:06,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6f51698/aae1ad81838044809484d6fb2750d48d/FLAG129fc7d39 [2025-03-03 21:34:06,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6f51698/aae1ad81838044809484d6fb2750d48d [2025-03-03 21:34:06,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:34:06,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:34:06,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:06,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:34:06,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:34:06,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cfa575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06, skipping insertion in model container [2025-03-03 21:34:06,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:34:06,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-03-03 21:34:06,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:06,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:34:06,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-03-03 21:34:06,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:06,846 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:34:06,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06 WrapperNode [2025-03-03 21:34:06,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:06,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:06,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:34:06,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:34:06,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,883 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-03 21:34:06,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:06,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:34:06,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:34:06,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:34:06,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,912 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:34:06,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:34:06,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:34:06,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:34:06,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:34:06,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (1/1) ... [2025-03-03 21:34:06,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:06,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:34:06,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:34:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:34:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:34:06,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:34:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:34:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:34:06,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:34:07,047 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:34:07,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:34:07,347 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise26#1; [2025-03-03 21:34:07,379 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:34:07,379 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:34:07,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:34:07,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:34:07,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:07 BoogieIcfgContainer [2025-03-03 21:34:07,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:34:07,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:34:07,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:34:07,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:34:07,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:06" (1/3) ... [2025-03-03 21:34:07,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:07, skipping insertion in model container [2025-03-03 21:34:07,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:06" (2/3) ... [2025-03-03 21:34:07,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:07, skipping insertion in model container [2025-03-03 21:34:07,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:07" (3/3) ... [2025-03-03 21:34:07,405 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:34:07,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:34:07,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:34:07,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:34:07,479 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;@13f73bc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:34:07,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:34:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 21:34:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:34:07,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:07,497 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:07,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -889341081, now seen corresponding path program 1 times [2025-03-03 21:34:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143513363] [2025-03-03 21:34:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:07,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:34:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:34:07,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:07,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 21:34:07,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143513363] [2025-03-03 21:34:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143513363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:07,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394079900] [2025-03-03 21:34:07,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:07,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:07,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:07,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:34:07,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:34:07,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:34:07,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:34:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:07,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:34:08,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 21:34:08,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:34:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394079900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:08,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:34:08,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:34:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551974923] [2025-03-03 21:34:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:34:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:34:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:08,056 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:34:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:08,088 INFO L93 Difference]: Finished difference Result 204 states and 359 transitions. [2025-03-03 21:34:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:34:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2025-03-03 21:34:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:08,094 INFO L225 Difference]: With dead ends: 204 [2025-03-03 21:34:08,095 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 21:34:08,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:08,099 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:08,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 21:34:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-03 21:34:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 21:34:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2025-03-03 21:34:08,140 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 217 [2025-03-03 21:34:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:08,141 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2025-03-03 21:34:08,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:34:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2025-03-03 21:34:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:34:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:08,146 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:08,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:34:08,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:34:08,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:08,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1440450631, now seen corresponding path program 1 times [2025-03-03 21:34:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111934342] [2025-03-03 21:34:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:34:08,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:34:08,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111934342] [2025-03-03 21:34:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111934342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:34:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538020153] [2025-03-03 21:34:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:34:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:09,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:34:09,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:34:09,514 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:10,368 INFO L93 Difference]: Finished difference Result 399 states and 630 transitions. [2025-03-03 21:34:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:34:10,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 21:34:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:10,372 INFO L225 Difference]: With dead ends: 399 [2025-03-03 21:34:10,372 INFO L226 Difference]: Without dead ends: 300 [2025-03-03 21:34:10,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:10,374 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 245 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:10,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 610 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:34:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-03 21:34:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 277. [2025-03-03 21:34:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 171 states have (on average 1.3625730994152048) internal successors, (233), 171 states have internal predecessors, (233), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:34:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 437 transitions. [2025-03-03 21:34:10,440 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 437 transitions. Word has length 217 [2025-03-03 21:34:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:10,441 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 437 transitions. [2025-03-03 21:34:10,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 437 transitions. [2025-03-03 21:34:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 21:34:10,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:10,443 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:10,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:34:10,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:10,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1785804633, now seen corresponding path program 1 times [2025-03-03 21:34:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269689094] [2025-03-03 21:34:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 21:34:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 21:34:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269689094] [2025-03-03 21:34:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269689094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:10,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:34:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640485672] [2025-03-03 21:34:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:34:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:10,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:34:10,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:10,982 INFO L87 Difference]: Start difference. First operand 277 states and 437 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:11,135 INFO L93 Difference]: Finished difference Result 377 states and 595 transitions. [2025-03-03 21:34:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:34:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 21:34:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:11,138 INFO L225 Difference]: With dead ends: 377 [2025-03-03 21:34:11,138 INFO L226 Difference]: Without dead ends: 278 [2025-03-03 21:34:11,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:11,139 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 222 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-03 21:34:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-03 21:34:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 172 states have internal predecessors, (234), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:34:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 438 transitions. [2025-03-03 21:34:11,188 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 438 transitions. Word has length 217 [2025-03-03 21:34:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:11,189 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 438 transitions. [2025-03-03 21:34:11,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 438 transitions. [2025-03-03 21:34:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:11,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:11,191 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:34:11,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1840341923, now seen corresponding path program 1 times [2025-03-03 21:34:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557129822] [2025-03-03 21:34:11,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:11,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:11,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:11,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:11,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:11,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:11,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557129822] [2025-03-03 21:34:11,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557129822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:11,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:11,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:34:11,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196179166] [2025-03-03 21:34:11,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:11,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:34:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:11,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:34:11,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:11,939 INFO L87 Difference]: Start difference. First operand 278 states and 438 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:12,857 INFO L93 Difference]: Finished difference Result 488 states and 768 transitions. [2025-03-03 21:34:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:34:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 21:34:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:12,860 INFO L225 Difference]: With dead ends: 488 [2025-03-03 21:34:12,860 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 21:34:12,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:34:12,863 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 213 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:12,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 717 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:34:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 21:34:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 290. [2025-03-03 21:34:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 184 states have (on average 1.375) internal successors, (253), 184 states have internal predecessors, (253), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:34:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2025-03-03 21:34:12,925 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 218 [2025-03-03 21:34:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2025-03-03 21:34:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2025-03-03 21:34:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:12,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:12,929 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:34:12,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:12,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 420791425, now seen corresponding path program 1 times [2025-03-03 21:34:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715272866] [2025-03-03 21:34:12,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:13,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:13,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:13,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715272866] [2025-03-03 21:34:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715272866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:34:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066999100] [2025-03-03 21:34:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:14,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:34:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:34:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:14,171 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:15,500 INFO L93 Difference]: Finished difference Result 727 states and 1139 transitions. [2025-03-03 21:34:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:34:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 21:34:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:15,504 INFO L225 Difference]: With dead ends: 727 [2025-03-03 21:34:15,504 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 21:34:15,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:34:15,505 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 388 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:15,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 576 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:34:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 21:34:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 429. [2025-03-03 21:34:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 268 states have internal predecessors, (358), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 21:34:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 670 transitions. [2025-03-03 21:34:15,583 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 670 transitions. Word has length 218 [2025-03-03 21:34:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 670 transitions. [2025-03-03 21:34:15,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 670 transitions. [2025-03-03 21:34:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 21:34:15,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:15,586 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:34:15,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:15,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash 224277920, now seen corresponding path program 1 times [2025-03-03 21:34:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930053987] [2025-03-03 21:34:15,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:15,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 21:34:15,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 21:34:15,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930053987] [2025-03-03 21:34:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930053987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:34:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797378514] [2025-03-03 21:34:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:55,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:34:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:34:55,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:34:55,769 INFO L87 Difference]: Start difference. First operand 429 states and 670 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:57,592 INFO L93 Difference]: Finished difference Result 731 states and 1131 transitions. [2025-03-03 21:34:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:34:57,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 21:34:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:57,597 INFO L225 Difference]: With dead ends: 731 [2025-03-03 21:34:57,597 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 21:34:57,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:34:57,599 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:57,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 804 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:34:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 21:34:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 457. [2025-03-03 21:34:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 295 states have (on average 1.3288135593220338) internal successors, (392), 296 states have internal predecessors, (392), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 21:34:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 704 transitions. [2025-03-03 21:34:57,653 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 704 transitions. Word has length 218 [2025-03-03 21:34:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 704 transitions. [2025-03-03 21:34:57,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 704 transitions. [2025-03-03 21:34:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:34:57,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:57,656 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:57,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:34:57,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:57,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1202850269, now seen corresponding path program 1 times [2025-03-03 21:34:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473931373] [2025-03-03 21:34:57,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:57,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:34:57,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:34:57,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:57,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473931373] [2025-03-03 21:34:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473931373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:58,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:58,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:34:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637297618] [2025-03-03 21:34:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:58,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:34:58,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:58,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:34:58,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:34:58,105 INFO L87 Difference]: Start difference. First operand 457 states and 704 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:59,256 INFO L93 Difference]: Finished difference Result 1107 states and 1726 transitions. [2025-03-03 21:34:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:34:59,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:34:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:59,263 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 21:34:59,263 INFO L226 Difference]: Without dead ends: 909 [2025-03-03 21:34:59,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:34:59,266 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 365 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:59,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1019 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:34:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-03 21:34:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 829. [2025-03-03 21:34:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 527 states have (on average 1.333965844402277) internal successors, (703), 528 states have internal predecessors, (703), 292 states have call successors, (292), 9 states have call predecessors, (292), 9 states have return successors, (292), 291 states have call predecessors, (292), 292 states have call successors, (292) [2025-03-03 21:34:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1287 transitions. [2025-03-03 21:34:59,353 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1287 transitions. Word has length 219 [2025-03-03 21:34:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1287 transitions. [2025-03-03 21:34:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1287 transitions. [2025-03-03 21:34:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:34:59,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:59,355 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:59,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:34:59,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash -830983679, now seen corresponding path program 1 times [2025-03-03 21:34:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:59,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119713463] [2025-03-03 21:34:59,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:59,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:34:59,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:34:59,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:59,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:34:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119713463] [2025-03-03 21:34:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119713463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:34:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933585575] [2025-03-03 21:34:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:34:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:59,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:34:59,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:34:59,646 INFO L87 Difference]: Start difference. First operand 829 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:34:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:59,987 INFO L93 Difference]: Finished difference Result 1234 states and 1908 transitions. [2025-03-03 21:34:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:34:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:34:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:59,991 INFO L225 Difference]: With dead ends: 1234 [2025-03-03 21:34:59,992 INFO L226 Difference]: Without dead ends: 501 [2025-03-03 21:34:59,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:59,995 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 110 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:59,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 536 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:34:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-03 21:35:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 472. [2025-03-03 21:35:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 310 states have (on average 1.3419354838709678) internal successors, (416), 311 states have internal predecessors, (416), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 21:35:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 728 transitions. [2025-03-03 21:35:00,047 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 728 transitions. Word has length 219 [2025-03-03 21:35:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 728 transitions. [2025-03-03 21:35:00,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 728 transitions. [2025-03-03 21:35:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:35:00,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:00,049 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:00,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:35:00,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:00,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 806713136, now seen corresponding path program 1 times [2025-03-03 21:35:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564292742] [2025-03-03 21:35:00,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:35:00,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:35:00,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:35:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:35:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564292742] [2025-03-03 21:35:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564292742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:00,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:35:00,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132165337] [2025-03-03 21:35:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:35:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:35:00,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:35:00,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:35:00,259 INFO L87 Difference]: Start difference. First operand 472 states and 728 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:00,523 INFO L93 Difference]: Finished difference Result 705 states and 1095 transitions. [2025-03-03 21:35:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:35:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:35:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:00,527 INFO L225 Difference]: With dead ends: 705 [2025-03-03 21:35:00,527 INFO L226 Difference]: Without dead ends: 498 [2025-03-03 21:35:00,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:35:00,529 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 98 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:00,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 405 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:35:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-03 21:35:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 480. [2025-03-03 21:35:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 318 states have (on average 1.3427672955974843) internal successors, (427), 319 states have internal predecessors, (427), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 21:35:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 739 transitions. [2025-03-03 21:35:00,576 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 739 transitions. Word has length 219 [2025-03-03 21:35:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:00,576 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 739 transitions. [2025-03-03 21:35:00,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 739 transitions. [2025-03-03 21:35:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:35:00,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:00,578 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:00,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:35:00,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:00,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1860860387, now seen corresponding path program 1 times [2025-03-03 21:35:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:00,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429518337] [2025-03-03 21:35:00,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:35:00,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:35:00,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:00,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:35:00,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:35:00,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429518337] [2025-03-03 21:35:00,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429518337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:35:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257296126] [2025-03-03 21:35:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:00,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:35:00,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:35:00,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:35:00,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:35:00,918 INFO L87 Difference]: Start difference. First operand 480 states and 739 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:01,383 INFO L93 Difference]: Finished difference Result 919 states and 1420 transitions. [2025-03-03 21:35:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:35:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:35:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:01,389 INFO L225 Difference]: With dead ends: 919 [2025-03-03 21:35:01,390 INFO L226 Difference]: Without dead ends: 819 [2025-03-03 21:35:01,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:35:01,391 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 439 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:01,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 334 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:35:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-03 21:35:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 581. [2025-03-03 21:35:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 384 states have (on average 1.3515625) internal successors, (519), 385 states have internal predecessors, (519), 190 states have call successors, (190), 6 states have call predecessors, (190), 6 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-03 21:35:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 899 transitions. [2025-03-03 21:35:01,461 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 899 transitions. Word has length 219 [2025-03-03 21:35:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:01,462 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 899 transitions. [2025-03-03 21:35:01,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 899 transitions. [2025-03-03 21:35:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:35:01,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:01,463 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:35:01,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 400272961, now seen corresponding path program 1 times [2025-03-03 21:35:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14551354] [2025-03-03 21:35:01,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:01,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:35:01,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:35:01,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:01,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:35:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:35:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14551354] [2025-03-03 21:35:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14551354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:35:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480312980] [2025-03-03 21:35:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:35:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:35:01,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:35:01,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:35:01,826 INFO L87 Difference]: Start difference. First operand 581 states and 899 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:02,433 INFO L93 Difference]: Finished difference Result 1073 states and 1653 transitions. [2025-03-03 21:35:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:35:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:35:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:02,438 INFO L225 Difference]: With dead ends: 1073 [2025-03-03 21:35:02,438 INFO L226 Difference]: Without dead ends: 872 [2025-03-03 21:35:02,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:35:02,439 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 553 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:02,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 375 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:35:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-03 21:35:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 631. [2025-03-03 21:35:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 413 states have (on average 1.3389830508474576) internal successors, (553), 415 states have internal predecessors, (553), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 21:35:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 973 transitions. [2025-03-03 21:35:02,514 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 973 transitions. Word has length 219 [2025-03-03 21:35:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:02,514 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 973 transitions. [2025-03-03 21:35:02,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 973 transitions. [2025-03-03 21:35:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:35:02,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:02,515 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:35:02,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 203759456, now seen corresponding path program 1 times [2025-03-03 21:35:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:02,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753978544] [2025-03-03 21:35:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:02,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:35:02,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:35:02,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:02,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:35:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:35:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753978544] [2025-03-03 21:35:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753978544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:35:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079508474] [2025-03-03 21:35:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:35:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:35:02,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:35:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:35:02,870 INFO L87 Difference]: Start difference. First operand 631 states and 973 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:35:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:03,448 INFO L93 Difference]: Finished difference Result 1334 states and 2074 transitions. [2025-03-03 21:35:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:35:03,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-03-03 21:35:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:03,454 INFO L225 Difference]: With dead ends: 1334 [2025-03-03 21:35:03,454 INFO L226 Difference]: Without dead ends: 987 [2025-03-03 21:35:03,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:35:03,457 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 306 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:03,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 350 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:35:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-03 21:35:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 819. [2025-03-03 21:35:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 531 states have (on average 1.344632768361582) internal successors, (714), 533 states have internal predecessors, (714), 278 states have call successors, (278), 9 states have call predecessors, (278), 9 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-03 21:35:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1270 transitions. [2025-03-03 21:35:03,556 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1270 transitions. Word has length 219 [2025-03-03 21:35:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1270 transitions. [2025-03-03 21:35:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:35:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1270 transitions. [2025-03-03 21:35:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 21:35:03,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:03,558 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:35:03,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1858714896, now seen corresponding path program 1 times [2025-03-03 21:35:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479650928] [2025-03-03 21:35:03,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 21:35:03,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 21:35:03,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:03,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:35:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:35:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479650928] [2025-03-03 21:35:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479650928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:35:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624828659] [2025-03-03 21:35:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:03,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:35:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:35:03,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:35:03,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:35:03,615 INFO L87 Difference]: Start difference. First operand 819 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:03,812 INFO L93 Difference]: Finished difference Result 1753 states and 2701 transitions. [2025-03-03 21:35:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:35:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-03 21:35:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:03,818 INFO L225 Difference]: With dead ends: 1753 [2025-03-03 21:35:03,818 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 21:35:03,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:35:03,821 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:03,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 303 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:35:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 21:35:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1010. [2025-03-03 21:35:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 722 states have (on average 1.394736842105263) internal successors, (1007), 724 states have internal predecessors, (1007), 278 states have call successors, (278), 9 states have call predecessors, (278), 9 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-03 21:35:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1563 transitions. [2025-03-03 21:35:03,929 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1563 transitions. Word has length 220 [2025-03-03 21:35:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:03,930 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1563 transitions. [2025-03-03 21:35:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:35:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1563 transitions. [2025-03-03 21:35:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 21:35:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:03,931 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:35:03,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139696, now seen corresponding path program 1 times [2025-03-03 21:35:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:35:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939302380] [2025-03-03 21:35:03,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:35:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 21:35:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 21:35:03,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:35:03,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107008429] [2025-03-03 21:35:03,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:03,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:35:03,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:35:04,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:35:04,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:35:04,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 21:35:04,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 21:35:04,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:04,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:35:04,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:35:04,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 21:35:04,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 21:35:04,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:04,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:35:04,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:35:04,390 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:35:04,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:35:04,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:35:04,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 21:35:04,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:04,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:35:04,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:35:04 BoogieIcfgContainer [2025-03-03 21:35:04,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:35:04,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:35:04,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:35:04,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:35:04,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:07" (3/4) ... [2025-03-03 21:35:04,700 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:35:04,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:35:04,701 INFO L158 Benchmark]: Toolchain (without parser) took 58104.09ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 111.2MB in the beginning and 559.1MB in the end (delta: -447.9MB). Peak memory consumption was 315.3MB. Max. memory is 16.1GB. [2025-03-03 21:35:04,701 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:35:04,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.03ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 94.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:35:04,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 90.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:35:04,702 INFO L158 Benchmark]: Boogie Preprocessor took 55.21ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:35:04,702 INFO L158 Benchmark]: IcfgBuilder took 457.33ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 53.5MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:35:04,702 INFO L158 Benchmark]: TraceAbstraction took 57297.29ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 53.1MB in the beginning and 559.3MB in the end (delta: -506.2MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. [2025-03-03 21:35:04,702 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 906.0MB. Free memory was 559.3MB in the beginning and 559.1MB in the end (delta: 189.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:35:04,703 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.28ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.03ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 94.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 90.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.21ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 457.33ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 53.5MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 57297.29ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 53.1MB in the beginning and 559.3MB in the end (delta: -506.2MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 906.0MB. Free memory was 559.3MB in the beginning and 559.1MB in the end (delta: 189.3kB). 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 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of bitwiseAnd at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] float var_1_23 = 3.2; [L43] unsigned long int var_1_27 = 2686167646; [L44] float var_1_29 = 5.5; [L45] unsigned char var_1_30 = 16; [L46] unsigned char var_1_31 = 0; [L47] signed long int var_1_32 = -2; [L48] unsigned short int var_1_33 = 1; [L49] unsigned long int var_1_34 = 3877983372; [L50] double var_1_35 = 16.75; [L51] double var_1_36 = 0.0; [L52] double var_1_37 = 99999.6; [L53] float var_1_38 = 25.6; [L54] float var_1_39 = 8.75; [L55] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L137] var_1_5 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L141] var_1_7 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L142] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L143] var_1_8 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L144] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L145] var_1_10 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L146] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L147] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L148] var_1_13 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L149] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L151] var_1_14 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L153] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L154] var_1_15 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L156] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L157] var_1_16 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L159] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L161] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L162] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L162] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L165] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L165] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L167] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L168] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L168] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L169] var_1_27 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L170] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L171] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L171] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L172] var_1_29 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L176] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L177] var_1_34 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_34 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L178] RET assume_abort_if_not(var_1_34 >= 3221225471) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L179] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L179] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L180] var_1_36 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L181] RET assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L182] var_1_37 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L185] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L199] RET updateVariables() [L200] CALL step() [L59] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L60] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L62] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L63] COND FALSE !(var_1_27 < var_1_34) [L70] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L72] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L73] var_1_32 = var_1_31 [L74] unsigned short int stepLocal_3 = var_1_12; [L75] unsigned short int stepLocal_2 = var_1_12; [L76] unsigned short int stepLocal_1 = var_1_12; [L77] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L78] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L78] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L79] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L93] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L98] COND TRUE var_1_12 <= ((var_1_34 - var_1_31) - ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) [L99] var_1_33 = 128 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L101] EXPR var_1_19 | var_1_12 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L101] COND FALSE !((var_1_19 | var_1_12) > var_1_19) [L108] var_1_35 = (((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) - var_1_37) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L110] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L111] COND TRUE var_1_13 <= var_1_11 [L112] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L116] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L117] COND TRUE var_1_19 <= var_1_1 [L118] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L120] EXPR var_1_1 & var_1_11 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L120] COND FALSE !(((((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) > (2u)) ? (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) : (2u))) > (var_1_1 & var_1_11)) [L129] var_1_23 = var_1_29 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L191-L192] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 14, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2987 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2987 mSDsluCounter, 6406 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 1002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5240 IncrementalHoareTripleChecker+Invalid, 6242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1002 mSolverCounterUnsat, 2612 mSDtfsCounter, 5240 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1010occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 1059 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 45.5s InterpolantComputationTime, 3496 NumberOfCodeBlocks, 3496 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3042 ConstructedInterpolants, 0 QuantifiedInterpolants, 16507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 31350/31416 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:35:04,913 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 21:35:04,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:35:06,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:35:06,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:35:06,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:35:06,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:35:06,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:35:06,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:35:06,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:35:06,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:35:06,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:35:06,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:35:06,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:35:06,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:35:06,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:35:06,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:06,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:35:06,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:35:06,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:35:06,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:35:06,834 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2025-03-03 21:35:07,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:35:07,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:35:07,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:35:07,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:35:07,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:35:07,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:35:08,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b002f5d3/0e0fffd421f44e6c9e6cd13c9b121aad/FLAG4e3522214 [2025-03-03 21:35:08,460 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:35:08,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:35:08,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b002f5d3/0e0fffd421f44e6c9e6cd13c9b121aad/FLAG4e3522214 [2025-03-03 21:35:08,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b002f5d3/0e0fffd421f44e6c9e6cd13c9b121aad [2025-03-03 21:35:08,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:35:08,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:35:08,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:35:08,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:35:08,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:35:08,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:35:08" (1/1) ... [2025-03-03 21:35:08,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7de358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:08, skipping insertion in model container [2025-03-03 21:35:08,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:35:08" (1/1) ... [2025-03-03 21:35:08,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:35:08,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-03-03 21:35:09,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:35:09,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:35:09,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-03-03 21:35:09,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:35:09,100 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:35:09,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09 WrapperNode [2025-03-03 21:35:09,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:35:09,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:35:09,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:35:09,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:35:09,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,145 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-03-03 21:35:09,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:35:09,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:35:09,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:35:09,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:35:09,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:35:09,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:35:09,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:35:09,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:35:09,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:35:09,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (1/1) ... [2025-03-03 21:35:09,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:35:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:35:09,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:35:09,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:35:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:35:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:35:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:35:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:35:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:35:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:35:09,342 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:35:09,344 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:35:12,589 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:35:12,589 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:35:12,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:35:12,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:35:12,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:35:12 BoogieIcfgContainer [2025-03-03 21:35:12,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:35:12,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:35:12,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:35:12,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:35:12,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:35:08" (1/3) ... [2025-03-03 21:35:12,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3aad2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:35:12, skipping insertion in model container [2025-03-03 21:35:12,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:09" (2/3) ... [2025-03-03 21:35:12,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3aad2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:35:12, skipping insertion in model container [2025-03-03 21:35:12,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:35:12" (3/3) ... [2025-03-03 21:35:12,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-03-03 21:35:12,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:35:12,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:35:12,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:35:12,668 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;@44a02f05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:35:12,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:35:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 21:35:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:35:12,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:12,685 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:12,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2051670832, now seen corresponding path program 1 times [2025-03-03 21:35:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689010034] [2025-03-03 21:35:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:12,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:35:12,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:12,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:35:12,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:35:12,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:35:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:35:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:13,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:13,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:35:13,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2025-03-03 21:35:13,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:13,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689010034] [2025-03-03 21:35:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689010034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:35:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103548397] [2025-03-03 21:35:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:35:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:13,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:35:13,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:35:13,181 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:35:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:13,201 INFO L93 Difference]: Finished difference Result 178 states and 317 transitions. [2025-03-03 21:35:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:35:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-03-03 21:35:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:13,208 INFO L225 Difference]: With dead ends: 178 [2025-03-03 21:35:13,208 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:35:13,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:35:13,212 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:13,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:35:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:35:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 21:35:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 21:35:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-03-03 21:35:13,256 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 212 [2025-03-03 21:35:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:13,256 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-03 21:35:13,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:35:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-03-03 21:35:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:35:13,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:13,260 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:13,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:35:13,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:35:13,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:13,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -555506704, now seen corresponding path program 1 times [2025-03-03 21:35:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649524293] [2025-03-03 21:35:13,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:13,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:35:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:13,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:35:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:35:13,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:35:13,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:35:13,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:13,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:13,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 21:35:13,899 INFO L279 TraceCheckSpWp]: Computing forward predicates...