./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.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-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:41:16,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:41:16,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:41:16,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:41:16,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:41:16,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:41:16,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:41:16,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:41:16,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:41:16,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:41:16,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:41:16,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:41:16,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:41:16,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:41:16,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:41:16,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:41:16,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:16,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:41:16,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:41:16,943 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2025-03-03 21:41:17,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:41:17,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:41:17,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:41:17,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:41:17,166 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:41:17,168 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-ps-ci_file-65.i [2025-03-03 21:41:18,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859a6201/35548121934c4b308daebc23a642f8f6/FLAG0856feab1 [2025-03-03 21:41:18,476 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:41:18,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2025-03-03 21:41:18,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859a6201/35548121934c4b308daebc23a642f8f6/FLAG0856feab1 [2025-03-03 21:41:18,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859a6201/35548121934c4b308daebc23a642f8f6 [2025-03-03 21:41:18,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:41:18,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:41:18,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:18,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:41:18,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:41:18,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fe0a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18, skipping insertion in model container [2025-03-03 21:41:18,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:41:18,628 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-ps-ci_file-65.i[919,932] [2025-03-03 21:41:18,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:18,693 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:41:18,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i[919,932] [2025-03-03 21:41:18,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:18,734 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:41:18,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18 WrapperNode [2025-03-03 21:41:18,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:18,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:18,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:41:18,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:41:18,740 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:41:18" (1/1) ... [2025-03-03 21:41:18,747 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:41:18" (1/1) ... [2025-03-03 21:41:18,783 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-03 21:41:18,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:18,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:41:18,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:41:18,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:41:18,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,816 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:41:18,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:41:18,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:41:18,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:41:18,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:41:18,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (1/1) ... [2025-03-03 21:41:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:18,860 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:41:18,862 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:41:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:41:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:41:18,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:41:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:41:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:41:18,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:41:18,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:41:18,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:41:19,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 21:41:19,318 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:41:19,318 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:41:19,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:41:19,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:41:19,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:19 BoogieIcfgContainer [2025-03-03 21:41:19,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:41:19,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:41:19,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:41:19,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:41:19,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:41:18" (1/3) ... [2025-03-03 21:41:19,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c282d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:19, skipping insertion in model container [2025-03-03 21:41:19,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:18" (2/3) ... [2025-03-03 21:41:19,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c282d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:19, skipping insertion in model container [2025-03-03 21:41:19,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:19" (3/3) ... [2025-03-03 21:41:19,343 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2025-03-03 21:41:19,353 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:41:19,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:41:19,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:41:19,403 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;@564222a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:41:19,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:41:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 78 states have internal predecessors, (117), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:19,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:19,419 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:19,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:19,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 787124000, now seen corresponding path program 1 times [2025-03-03 21:41:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:19,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264158886] [2025-03-03 21:41:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:19,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:41:19,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264158886] [2025-03-03 21:41:19,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264158886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:41:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245600247] [2025-03-03 21:41:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:41:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:19,655 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:41:19,656 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:41:19,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:19,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:19,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:41:19,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:41:19,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:41:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245600247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:19,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:41:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:41:19,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630403257] [2025-03-03 21:41:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:41:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:19,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:41:19,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:41:19,872 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 78 states have internal predecessors, (117), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:19,906 INFO L93 Difference]: Finished difference Result 196 states and 337 transitions. [2025-03-03 21:41:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:41:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-03-03 21:41:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:19,912 INFO L225 Difference]: With dead ends: 196 [2025-03-03 21:41:19,912 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 21:41:19,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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:41:19,919 INFO L435 NwaCegarLoop]: 146 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, 146 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:41:19,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:41:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 21:41:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 21:41:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-03-03 21:41:19,956 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 152 [2025-03-03 21:41:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-03-03 21:41:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-03-03 21:41:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:19,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:19,961 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:19,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:41:20,162 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:41:20,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2125628574, now seen corresponding path program 1 times [2025-03-03 21:41:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176950512] [2025-03-03 21:41:20,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:20,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:20,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:20,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176950512] [2025-03-03 21:41:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176950512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:41:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111165234] [2025-03-03 21:41:20,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:20,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:41:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:20,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:41:20,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:41:20,378 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:20,462 INFO L93 Difference]: Finished difference Result 285 states and 444 transitions. [2025-03-03 21:41:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:41:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:41:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:20,466 INFO L225 Difference]: With dead ends: 285 [2025-03-03 21:41:20,466 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 21:41:20,467 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:41:20,469 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 134 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:20,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 388 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 21:41:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 114. [2025-03-03 21:41:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 174 transitions. [2025-03-03 21:41:20,487 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 174 transitions. Word has length 152 [2025-03-03 21:41:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:20,489 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 174 transitions. [2025-03-03 21:41:20,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2025-03-03 21:41:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 21:41:20,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:20,490 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:20,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:41:20,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -848746438, now seen corresponding path program 1 times [2025-03-03 21:41:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372891205] [2025-03-03 21:41:20,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 21:41:20,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 21:41:20,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:20,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372891205] [2025-03-03 21:41:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372891205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:41:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734736324] [2025-03-03 21:41:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:41:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:41:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:41:20,632 INFO L87 Difference]: Start difference. First operand 114 states and 174 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:20,665 INFO L93 Difference]: Finished difference Result 206 states and 313 transitions. [2025-03-03 21:41:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:41:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 21:41:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:20,667 INFO L225 Difference]: With dead ends: 206 [2025-03-03 21:41:20,667 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 21:41:20,668 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:41:20,669 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:20,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:41:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 21:41:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-03 21:41:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2025-03-03 21:41:20,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 153 [2025-03-03 21:41:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:20,679 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2025-03-03 21:41:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2025-03-03 21:41:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 21:41:20,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:20,682 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:41:20,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1570230209, now seen corresponding path program 1 times [2025-03-03 21:41:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072910102] [2025-03-03 21:41:20,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:20,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 21:41:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 21:41:20,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072910102] [2025-03-03 21:41:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072910102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:21,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:41:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035948050] [2025-03-03 21:41:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:21,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:41:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:21,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:41:21,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:41:21,422 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:21,772 INFO L93 Difference]: Finished difference Result 326 states and 493 transitions. [2025-03-03 21:41:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:41:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 21:41:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:21,774 INFO L225 Difference]: With dead ends: 326 [2025-03-03 21:41:21,774 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 21:41:21,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:41:21,775 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 313 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:21,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 828 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:41:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 21:41:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 169. [2025-03-03 21:41:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:41:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2025-03-03 21:41:21,795 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 154 [2025-03-03 21:41:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:21,795 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2025-03-03 21:41:21,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2025-03-03 21:41:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:41:21,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:21,796 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:21,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:41:21,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:21,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1520963625, now seen corresponding path program 1 times [2025-03-03 21:41:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566531926] [2025-03-03 21:41:21,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:21,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:41:21,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:41:21,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:21,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566531926] [2025-03-03 21:41:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566531926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:41:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646722658] [2025-03-03 21:41:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:41:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:22,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:41:22,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:41:22,487 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:23,016 INFO L93 Difference]: Finished difference Result 510 states and 739 transitions. [2025-03-03 21:41:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:41:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 155 [2025-03-03 21:41:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:23,022 INFO L225 Difference]: With dead ends: 510 [2025-03-03 21:41:23,022 INFO L226 Difference]: Without dead ends: 344 [2025-03-03 21:41:23,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:41:23,023 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 517 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:23,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 437 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:41:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-03 21:41:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 311. [2025-03-03 21:41:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 234 states have (on average 1.329059829059829) internal successors, (311), 236 states have internal predecessors, (311), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 21:41:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 447 transitions. [2025-03-03 21:41:23,064 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 447 transitions. Word has length 155 [2025-03-03 21:41:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 447 transitions. [2025-03-03 21:41:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 447 transitions. [2025-03-03 21:41:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:41:23,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:23,066 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:23,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:41:23,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:23,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash 966549208, now seen corresponding path program 1 times [2025-03-03 21:41:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968714589] [2025-03-03 21:41:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:23,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:41:23,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:41:23,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968714589] [2025-03-03 21:41:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968714589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:23,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:41:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807218949] [2025-03-03 21:41:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:23,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:41:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:23,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:41:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:41:23,645 INFO L87 Difference]: Start difference. First operand 311 states and 447 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:24,191 INFO L93 Difference]: Finished difference Result 806 states and 1165 transitions. [2025-03-03 21:41:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:41:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-03 21:41:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:24,197 INFO L225 Difference]: With dead ends: 806 [2025-03-03 21:41:24,197 INFO L226 Difference]: Without dead ends: 498 [2025-03-03 21:41:24,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:41:24,199 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 370 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:24,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 857 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:41:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-03 21:41:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 466. [2025-03-03 21:41:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 339 states have (on average 1.3185840707964602) internal successors, (447), 341 states have internal predecessors, (447), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 21:41:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 671 transitions. [2025-03-03 21:41:24,272 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 671 transitions. Word has length 155 [2025-03-03 21:41:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:24,272 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 671 transitions. [2025-03-03 21:41:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 671 transitions. [2025-03-03 21:41:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:41:24,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:24,274 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:41:24,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -559349608, now seen corresponding path program 1 times [2025-03-03 21:41:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790983595] [2025-03-03 21:41:24,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:24,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:41:24,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:41:24,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:24,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790983595] [2025-03-03 21:41:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790983595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:41:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835935518] [2025-03-03 21:41:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:41:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:24,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:41:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:41:24,797 INFO L87 Difference]: Start difference. First operand 466 states and 671 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:25,111 INFO L93 Difference]: Finished difference Result 774 states and 1094 transitions. [2025-03-03 21:41:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:41:25,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 155 [2025-03-03 21:41:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:25,114 INFO L225 Difference]: With dead ends: 774 [2025-03-03 21:41:25,114 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 21:41:25,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:41:25,116 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 297 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:25,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 269 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:41:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 21:41:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 262. [2025-03-03 21:41:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 183 states have (on average 1.273224043715847) internal successors, (233), 183 states have internal predecessors, (233), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:41:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2025-03-03 21:41:25,139 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 365 transitions. Word has length 155 [2025-03-03 21:41:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 365 transitions. [2025-03-03 21:41:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2025-03-03 21:41:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:41:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:25,141 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:41:25,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 254382172, now seen corresponding path program 1 times [2025-03-03 21:41:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970020766] [2025-03-03 21:41:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:25,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:41:25,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:41:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:41:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970020766] [2025-03-03 21:41:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970020766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:41:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452293138] [2025-03-03 21:41:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:41:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:25,336 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:41:25,338 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:41:25,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:41:25,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:41:25,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:25,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:41:25,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 21:41:25,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:41:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:41:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452293138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:41:26,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:41:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2025-03-03 21:41:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883234939] [2025-03-03 21:41:26,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:41:26,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:41:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:26,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:41:26,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:41:26,056 INFO L87 Difference]: Start difference. First operand 262 states and 365 transitions. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2025-03-03 21:41:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:26,253 INFO L93 Difference]: Finished difference Result 381 states and 519 transitions. [2025-03-03 21:41:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:41:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 158 [2025-03-03 21:41:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:26,255 INFO L225 Difference]: With dead ends: 381 [2025-03-03 21:41:26,255 INFO L226 Difference]: Without dead ends: 192 [2025-03-03 21:41:26,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:41:26,256 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 198 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:26,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 350 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-03 21:41:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2025-03-03 21:41:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.2276422764227641) internal successors, (151), 123 states have internal predecessors, (151), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:41:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 239 transitions. [2025-03-03 21:41:26,274 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 239 transitions. Word has length 158 [2025-03-03 21:41:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:26,274 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 239 transitions. [2025-03-03 21:41:26,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2025-03-03 21:41:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 239 transitions. [2025-03-03 21:41:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:41:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:26,276 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:26,282 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:41:26,476 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,SelfDestructingSolverStorable7 [2025-03-03 21:41:26,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 697482227, now seen corresponding path program 1 times [2025-03-03 21:41:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631914463] [2025-03-03 21:41:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:26,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:41:26,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:41:26,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:26,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:41:26,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:41:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:41:26,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:41:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:41:26,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:41:26,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:41:26,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:41:26,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:41:26,630 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:26,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:41:26,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:41:26 BoogieIcfgContainer [2025-03-03 21:41:26,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:41:26,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:41:26,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:41:26,742 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:41:26,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:19" (3/4) ... [2025-03-03 21:41:26,744 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:41:26,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:41:26,745 INFO L158 Benchmark]: Toolchain (without parser) took 8239.74ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 132.8MB in the beginning and 259.4MB in the end (delta: -126.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-03-03 21:41:26,745 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:41:26,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.70ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 117.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:41:26,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.44ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:41:26,746 INFO L158 Benchmark]: Boogie Preprocessor took 47.33ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 110.1MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:41:26,746 INFO L158 Benchmark]: IcfgBuilder took 502.13ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 80.9MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:41:26,746 INFO L158 Benchmark]: TraceAbstraction took 7403.36ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 80.0MB in the beginning and 259.4MB in the end (delta: -179.4MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2025-03-03 21:41:26,746 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 318.8MB. Free memory was 259.4MB in the beginning and 259.4MB in the end (delta: 22.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:41:26,747 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.35ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.70ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 117.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.44ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.33ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 110.1MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 502.13ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 80.9MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7403.36ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 80.0MB in the beginning and 259.4MB in the end (delta: -179.4MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 318.8MB. Free memory was 259.4MB in the beginning and 259.4MB in the end (delta: 22.8kB). 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 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] unsigned short int var_1_33 = 16; [L43] unsigned char var_1_39 = 4; [L44] signed long int var_1_41 = -5; [L45] double var_1_42 = 49.6; [L46] signed long int var_1_45 = -2; [L47] unsigned long int var_1_47 = 16; [L48] unsigned long int var_1_50 = 1275815169; [L49] unsigned long int var_1_51 = 1483937619; [L50] signed short int last_1_var_1_1 = 4; [L51] unsigned char last_1_var_1_14 = 1; [L52] signed char last_1_var_1_16 = 50; [L53] signed long int last_1_var_1_23 = -16; [L54] unsigned char last_1_var_1_24 = 1; [L55] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L180] last_1_var_1_23 = var_1_23 [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L141] var_1_11 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] var_1_13 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] var_1_21 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_22 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] var_1_25 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_26 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] var_1_50 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L172] var_1_51 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L173] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L174] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L174] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L193] RET updateVariables() [L194] CALL step() [L59] var_1_29 = var_1_25 [L60] var_1_31 = var_1_19 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L61] COND TRUE \read(var_1_24) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L62] COND TRUE var_1_25 < var_1_19 [L63] var_1_33 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L70] var_1_39 = var_1_26 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L71] COND FALSE !(var_1_12 != var_1_1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L76] COND FALSE !(1000000.4f != var_1_21) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L81] COND TRUE var_1_24 && var_1_14 [L82] var_1_45 = (((((var_1_16 + var_1_26)) > (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? ((var_1_16 + var_1_26)) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L86] COND FALSE !(var_1_22 < var_1_22) [L99] var_1_47 = var_1_1 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L101] signed long int stepLocal_3 = last_1_var_1_23; [L102] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L103] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L114] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L116] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L116] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L117] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L121] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L122] var_1_28 = var_1_21 [L123] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L124] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L125] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L129] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L130] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L131] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L131] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L132] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L134] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L135] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185-L186] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=4, var_1_13=32770, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=0, var_1_33=32767, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1835 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1829 mSDsluCounter, 3539 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1986 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1411 IncrementalHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 1553 mSDtfsCounter, 1411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 355 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1703 NumberOfCodeBlocks, 1703 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1691 ConstructedInterpolants, 0 QuantifiedInterpolants, 5147 SizeOfPredicates, 3 NumberOfNonLiveVariables, 781 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 9987/10164 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:41:26,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:41:28,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:41:28,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:41:28,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:41:28,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:41:28,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:41:28,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:41:28,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:41:28,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:41:28,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:41:28,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:41:28,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:41:28,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:41:28,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:41:28,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:41:28,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:28,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:41:28,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:41:28,687 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2025-03-03 21:41:28,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:41:28,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:41:28,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:41:28,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:41:28,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:41:28,941 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-ps-ci_file-65.i [2025-03-03 21:41:30,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab234852/57f7a7b3345e4a798c2fe6da56cf68e1/FLAG7a424b2cf [2025-03-03 21:41:30,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:41:30,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2025-03-03 21:41:30,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab234852/57f7a7b3345e4a798c2fe6da56cf68e1/FLAG7a424b2cf [2025-03-03 21:41:30,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab234852/57f7a7b3345e4a798c2fe6da56cf68e1 [2025-03-03 21:41:30,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:41:30,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:41:30,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:30,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:41:30,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:41:30,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7a012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30, skipping insertion in model container [2025-03-03 21:41:30,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:41:30,455 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-ps-ci_file-65.i[919,932] [2025-03-03 21:41:30,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:30,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:41:30,528 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-ps-ci_file-65.i[919,932] [2025-03-03 21:41:30,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:30,561 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:41:30,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30 WrapperNode [2025-03-03 21:41:30,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:30,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:30,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:41:30,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:41:30,567 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:41:30" (1/1) ... [2025-03-03 21:41:30,577 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:41:30" (1/1) ... [2025-03-03 21:41:30,605 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-03 21:41:30,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:30,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:41:30,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:41:30,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:41:30,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,629 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:41:30,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:41:30,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:41:30,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:41:30,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:41:30,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (1/1) ... [2025-03-03 21:41:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:30,676 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:41:30,679 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:41:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:41:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:41:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:41:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:41:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:41:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:41:30,758 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:41:30,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:41:32,334 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 21:41:32,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:41:32,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:41:32,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:41:32,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:32 BoogieIcfgContainer [2025-03-03 21:41:32,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:41:32,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:41:32,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:41:32,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:41:32,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:41:30" (1/3) ... [2025-03-03 21:41:32,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495b229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:32, skipping insertion in model container [2025-03-03 21:41:32,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:30" (2/3) ... [2025-03-03 21:41:32,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495b229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:32, skipping insertion in model container [2025-03-03 21:41:32,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:32" (3/3) ... [2025-03-03 21:41:32,351 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2025-03-03 21:41:32,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:41:32,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:41:32,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:41:32,403 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;@46e4999d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:41:32,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:41:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 21:41:32,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:32,414 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:32,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 83702675, now seen corresponding path program 1 times [2025-03-03 21:41:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:41:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054383360] [2025-03-03 21:41:32,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:32,425 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:41:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:41:32,427 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:41:32,428 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:41:32,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 21:41:32,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 21:41:32,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:32,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:32,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:41:32,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 21:41:32,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:41:32,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:41:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054383360] [2025-03-03 21:41:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054383360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:41:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618393756] [2025-03-03 21:41:32,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:41:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:41:32,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:41:32,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:41:32,726 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:32,741 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2025-03-03 21:41:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:41:32,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2025-03-03 21:41:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:32,746 INFO L225 Difference]: With dead ends: 143 [2025-03-03 21:41:32,746 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 21:41:32,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:41:32,750 INFO L435 NwaCegarLoop]: 106 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, 106 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:41:32,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:41:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 21:41:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 21:41:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 21:41:32,775 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 146 [2025-03-03 21:41:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:32,776 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 21:41:32,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 21:41:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 21:41:32,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:32,780 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:32,790 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:41:32,981 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:41:32,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash -246243439, now seen corresponding path program 1 times [2025-03-03 21:41:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:41:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684960930] [2025-03-03 21:41:32,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:32,984 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:41:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:41:32,986 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:41:32,988 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:41:33,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 21:41:33,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 21:41:33,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:33,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:41:33,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 21:41:33,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:41:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:41:33,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:41:33,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684960930] [2025-03-03 21:41:33,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684960930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:41:33,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:41:33,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 21:41:33,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36551936] [2025-03-03 21:41:33,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:41:33,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:41:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:41:33,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:41:33,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:41:33,739 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:41:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:34,689 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2025-03-03 21:41:34,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:41:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 146 [2025-03-03 21:41:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:34,692 INFO L225 Difference]: With dead ends: 156 [2025-03-03 21:41:34,694 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:41:34,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:41:34,695 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:34,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 210 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:41:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:41:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-03-03 21:41:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:41:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2025-03-03 21:41:34,707 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 146 [2025-03-03 21:41:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:34,708 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2025-03-03 21:41:34,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 21:41:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2025-03-03 21:41:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 21:41:34,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:34,709 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:34,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:41:34,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:41:34,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:34,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash 928743894, now seen corresponding path program 1 times [2025-03-03 21:41:34,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:41:34,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001416473] [2025-03-03 21:41:34,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:34,911 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:41:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:41:34,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:41:34,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:41:34,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 21:41:35,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 21:41:35,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:35,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:35,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:41:35,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-03-03 21:41:35,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:41:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 21:41:35,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:41:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001416473] [2025-03-03 21:41:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001416473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:41:35,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:41:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 21:41:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552679020] [2025-03-03 21:41:35,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:41:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:41:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:41:35,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:41:35,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:41:35,440 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:41:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:36,967 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2025-03-03 21:41:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:41:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 147 [2025-03-03 21:41:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:36,970 INFO L225 Difference]: With dead ends: 223 [2025-03-03 21:41:36,972 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 21:41:36,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:41:36,973 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 196 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:36,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 370 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:41:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 21:41:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2025-03-03 21:41:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 82 states have internal predecessors, (100), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:41:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 188 transitions. [2025-03-03 21:41:36,993 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 188 transitions. Word has length 147 [2025-03-03 21:41:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:36,994 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 188 transitions. [2025-03-03 21:41:36,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:41:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 188 transitions. [2025-03-03 21:41:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 21:41:36,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:36,998 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:41:37,007 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 (4)] Ended with exit code 0 [2025-03-03 21:41:37,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:41:37,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:37,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash 929667415, now seen corresponding path program 1 times [2025-03-03 21:41:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:41:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743604758] [2025-03-03 21:41:37,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:37,200 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:41:37,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:41:37,201 INFO L229 MonitoredProcess]: Starting monitored process 5 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:41:37,202 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 (5)] Waiting until timeout for monitored process [2025-03-03 21:41:37,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 21:41:37,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 21:41:37,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:37,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:37,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 21:41:37,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:56,986 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 21:42:16,881 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 21:42:39,675 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)