./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.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 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:53:41,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:53:41,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:53:41,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:53:41,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:53:41,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:53:41,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:53:41,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:53:41,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:53:41,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:53:41,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:53:41,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:53:41,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:53:41,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:53:41,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:53:41,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:53:41,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:53:41,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:53:41,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:53:41,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:53:41,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:53:41,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:53:41,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:53:41,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:53:41,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:53:41,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:53:41,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:53:41,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:53:41,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:53:41,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:53:41,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:53:41,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:53:41,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:53:41,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:53:41,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:53:41,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:53:41,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:53:41,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:53:41,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:53:41,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:53:41,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:53:41,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:53:41,851 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd [2024-11-08 21:53:42,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:53:42,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:53:42,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:53:42,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:53:42,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:53:42,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:53:43,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:53:43,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:53:43,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:53:43,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966572e4f/71fc43a4014c43c98cf5fc9ebfbf76a8/FLAGde4e227ff [2024-11-08 21:53:44,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966572e4f/71fc43a4014c43c98cf5fc9ebfbf76a8 [2024-11-08 21:53:44,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:53:44,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:53:44,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:53:44,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:53:44,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:53:44,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298d59d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44, skipping insertion in model container [2024-11-08 21:53:44,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:53:44,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2024-11-08 21:53:44,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:53:44,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:53:44,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2024-11-08 21:53:44,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:53:44,524 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:53:44,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44 WrapperNode [2024-11-08 21:53:44,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:53:44,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:53:44,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:53:44,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:53:44,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,605 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2024-11-08 21:53:44,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:53:44,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:53:44,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:53:44,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:53:44,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,689 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]. [2024-11-08 21:53:44,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:53:44,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:53:44,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:53:44,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:53:44,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (1/1) ... [2024-11-08 21:53:44,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:53:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:53:44,778 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) [2024-11-08 21:53:44,784 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 [2024-11-08 21:53:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:53:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:53:44,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:53:44,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:53:44,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:53:44,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:53:44,927 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:53:44,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:53:45,401 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 21:53:45,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:53:45,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:53:45,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:53:45,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:53:45 BoogieIcfgContainer [2024-11-08 21:53:45,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:53:45,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:53:45,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:53:45,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:53:45,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:53:44" (1/3) ... [2024-11-08 21:53:45,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf372a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:53:45, skipping insertion in model container [2024-11-08 21:53:45,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:53:44" (2/3) ... [2024-11-08 21:53:45,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf372a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:53:45, skipping insertion in model container [2024-11-08 21:53:45,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:53:45" (3/3) ... [2024-11-08 21:53:45,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:53:45,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:53:45,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:53:45,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:53:45,532 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;@565cc0a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:53:45,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:53:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:53:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 21:53:45,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:45,562 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:45,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash -81267385, now seen corresponding path program 1 times [2024-11-08 21:53:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730971561] [2024-11-08 21:53:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:53:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730971561] [2024-11-08 21:53:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730971561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:53:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:53:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:53:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607695313] [2024-11-08 21:53:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:53:46,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:53:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:53:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:53:46,252 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:53:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:46,292 INFO L93 Difference]: Finished difference Result 194 states and 351 transitions. [2024-11-08 21:53:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:53:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 234 [2024-11-08 21:53:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:46,303 INFO L225 Difference]: With dead ends: 194 [2024-11-08 21:53:46,304 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 21:53:46,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:53:46,312 INFO L432 NwaCegarLoop]: 151 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, 151 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 [2024-11-08 21:53:46,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:53:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 21:53:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 21:53:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:53:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2024-11-08 21:53:46,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 234 [2024-11-08 21:53:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:46,383 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2024-11-08 21:53:46,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:53:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2024-11-08 21:53:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 21:53:46,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:46,392 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:53:46,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1449879045, now seen corresponding path program 1 times [2024-11-08 21:53:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676713773] [2024-11-08 21:53:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:53:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676713773] [2024-11-08 21:53:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676713773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:53:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:53:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:53:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036043856] [2024-11-08 21:53:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:53:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:53:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:53:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:53:46,835 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:46,912 INFO L93 Difference]: Finished difference Result 249 states and 391 transitions. [2024-11-08 21:53:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:53:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-11-08 21:53:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:46,922 INFO L225 Difference]: With dead ends: 249 [2024-11-08 21:53:46,922 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 21:53:46,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:53:46,928 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 90 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:46,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:53:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 21:53:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-08 21:53:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 95 states have (on average 1.368421052631579) internal successors, (130), 96 states have internal predecessors, (130), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 21:53:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 240 transitions. [2024-11-08 21:53:46,968 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 240 transitions. Word has length 234 [2024-11-08 21:53:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:46,969 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 240 transitions. [2024-11-08 21:53:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 240 transitions. [2024-11-08 21:53:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 21:53:46,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:46,977 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:53:46,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1872580871, now seen corresponding path program 1 times [2024-11-08 21:53:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142763363] [2024-11-08 21:53:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:53:47,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142763363] [2024-11-08 21:53:47,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142763363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:53:47,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:53:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:53:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137516596] [2024-11-08 21:53:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:53:47,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:53:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:53:47,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:53:47,585 INFO L87 Difference]: Start difference. First operand 153 states and 240 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:47,862 INFO L93 Difference]: Finished difference Result 422 states and 666 transitions. [2024-11-08 21:53:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:53:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-11-08 21:53:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:47,873 INFO L225 Difference]: With dead ends: 422 [2024-11-08 21:53:47,873 INFO L226 Difference]: Without dead ends: 272 [2024-11-08 21:53:47,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:53:47,878 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 117 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:47,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 435 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:53:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-08 21:53:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 217. [2024-11-08 21:53:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 122 states have internal predecessors, (156), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 21:53:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 340 transitions. [2024-11-08 21:53:47,943 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 340 transitions. Word has length 234 [2024-11-08 21:53:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:47,945 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 340 transitions. [2024-11-08 21:53:47,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 340 transitions. [2024-11-08 21:53:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:53:47,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:47,954 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:53:47,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1525934178, now seen corresponding path program 1 times [2024-11-08 21:53:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015318221] [2024-11-08 21:53:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:53:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015318221] [2024-11-08 21:53:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015318221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:53:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:53:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:53:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696037604] [2024-11-08 21:53:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:53:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:53:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:53:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:53:48,316 INFO L87 Difference]: Start difference. First operand 217 states and 340 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:48,354 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2024-11-08 21:53:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:53:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2024-11-08 21:53:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:48,358 INFO L225 Difference]: With dead ends: 367 [2024-11-08 21:53:48,359 INFO L226 Difference]: Without dead ends: 217 [2024-11-08 21:53:48,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:53:48,360 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:48,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:53:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-08 21:53:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-08 21:53:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 122 states have internal predecessors, (154), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 21:53:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 338 transitions. [2024-11-08 21:53:48,398 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 338 transitions. Word has length 235 [2024-11-08 21:53:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 338 transitions. [2024-11-08 21:53:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:53:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 338 transitions. [2024-11-08 21:53:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:53:48,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:48,404 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:48,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:53:48,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2067968540, now seen corresponding path program 1 times [2024-11-08 21:53:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211627313] [2024-11-08 21:53:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-08 21:53:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211627313] [2024-11-08 21:53:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211627313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:53:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620340707] [2024-11-08 21:53:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:48,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:48,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:53:48,955 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) [2024-11-08 21:53:48,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:53:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:49,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:53:49,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:53:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2024-11-08 21:53:49,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:53:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-08 21:53:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620340707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:53:49,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:53:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:53:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415600225] [2024-11-08 21:53:49,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:53:49,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:53:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:53:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:53:49,713 INFO L87 Difference]: Start difference. First operand 217 states and 338 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 21:53:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:49,967 INFO L93 Difference]: Finished difference Result 322 states and 495 transitions. [2024-11-08 21:53:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:53:49,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 235 [2024-11-08 21:53:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:49,970 INFO L225 Difference]: With dead ends: 322 [2024-11-08 21:53:49,970 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 21:53:49,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:53:49,972 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 131 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:49,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 244 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:53:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 21:53:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2024-11-08 21:53:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 89 states have internal predecessors, (106), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 21:53:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2024-11-08 21:53:49,991 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 235 [2024-11-08 21:53:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:49,992 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2024-11-08 21:53:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 21:53:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2024-11-08 21:53:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:53:49,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:49,995 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:50,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:53:50,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:50,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:50,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1585442212, now seen corresponding path program 1 times [2024-11-08 21:53:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469832756] [2024-11-08 21:53:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:53:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:53:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:53:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:53:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:53:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:53:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:53:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:53:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:53:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:53:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:53:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:53:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:53:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:53:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:53:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:53:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:53:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:53:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:53:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:53:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:53:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:53:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:53:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 21:53:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:53:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:53:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:53:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:53:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:53:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:53:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 21:53:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 21:53:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 21:53:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 21:53:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 21:53:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 21:53:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 21:53:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 159 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2024-11-08 21:53:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469832756] [2024-11-08 21:53:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469832756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:53:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071798621] [2024-11-08 21:53:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:53:51,142 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) [2024-11-08 21:53:51,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:53:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:51,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 21:53:51,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:53:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-08 21:53:52,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:53:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2024-11-08 21:53:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071798621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:53:52,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:53:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-08 21:53:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977250417] [2024-11-08 21:53:52,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:53:52,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 21:53:52,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 21:53:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:53:52,716 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2024-11-08 21:53:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:53,912 INFO L93 Difference]: Finished difference Result 514 states and 744 transitions. [2024-11-08 21:53:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 21:53:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) Word has length 235 [2024-11-08 21:53:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:53,916 INFO L225 Difference]: With dead ends: 514 [2024-11-08 21:53:53,916 INFO L226 Difference]: Without dead ends: 417 [2024-11-08 21:53:53,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 538 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 21:53:53,919 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 432 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:53,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 769 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:53:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-08 21:53:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 286. [2024-11-08 21:53:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-08 21:53:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2024-11-08 21:53:53,968 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 235 [2024-11-08 21:53:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2024-11-08 21:53:53,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2024-11-08 21:53:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2024-11-08 21:53:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:53:53,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:53,974 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:53,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:53:54,174 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,SelfDestructingSolverStorable5 [2024-11-08 21:53:54,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:54,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash -103501530, now seen corresponding path program 1 times [2024-11-08 21:53:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:54,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831415883] [2024-11-08 21:53:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:53:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243527605] [2024-11-08 21:53:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:53:54,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:53:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:53:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:54,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 21:53:54,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:53:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-11-08 21:53:55,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:53:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831415883] [2024-11-08 21:53:55,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:53:55,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243527605] [2024-11-08 21:53:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243527605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:53:55,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:53:55,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-08 21:53:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743173889] [2024-11-08 21:53:55,863 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 21:53:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:53:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:53:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=136, Unknown=4, NotChecked=0, Total=182 [2024-11-08 21:53:55,864 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:53:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:53:56,605 INFO L93 Difference]: Finished difference Result 855 states and 1225 transitions. [2024-11-08 21:53:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 21:53:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2024-11-08 21:53:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:53:56,611 INFO L225 Difference]: With dead ends: 855 [2024-11-08 21:53:56,611 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 21:53:56,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=431, Unknown=4, NotChecked=0, Total=600 [2024-11-08 21:53:56,613 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 217 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:53:56,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 801 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:53:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 21:53:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 558. [2024-11-08 21:53:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 343 states have (on average 1.2448979591836735) internal successors, (427), 345 states have internal predecessors, (427), 189 states have call successors, (189), 25 states have call predecessors, (189), 25 states have return successors, (189), 187 states have call predecessors, (189), 189 states have call successors, (189) [2024-11-08 21:53:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 805 transitions. [2024-11-08 21:53:56,673 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 805 transitions. Word has length 235 [2024-11-08 21:53:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:53:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 805 transitions. [2024-11-08 21:53:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:53:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 805 transitions. [2024-11-08 21:53:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:53:56,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:53:56,676 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:53:56,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:53:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:56,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:53:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:53:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2097646236, now seen corresponding path program 1 times [2024-11-08 21:53:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:53:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638607983] [2024-11-08 21:53:56,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:53:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:53:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507573445] [2024-11-08 21:53:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:53:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:53:56,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:53:56,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:53:56,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 21:53:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:53:57,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 21:53:57,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:53:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-11-08 21:53:58,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:53:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:53:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638607983] [2024-11-08 21:53:59,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:53:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507573445] [2024-11-08 21:53:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507573445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:53:59,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:53:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-08 21:53:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121891277] [2024-11-08 21:53:59,491 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 21:53:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:53:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:53:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:53:59,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-08 21:53:59,493 INFO L87 Difference]: Start difference. First operand 558 states and 805 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:54:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:00,349 INFO L93 Difference]: Finished difference Result 1113 states and 1610 transitions. [2024-11-08 21:54:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 21:54:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2024-11-08 21:54:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:00,358 INFO L225 Difference]: With dead ends: 1113 [2024-11-08 21:54:00,358 INFO L226 Difference]: Without dead ends: 906 [2024-11-08 21:54:00,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-08 21:54:00,361 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 199 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 90 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:00,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1084 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 651 Invalid, 6 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:54:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-08 21:54:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 771. [2024-11-08 21:54:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 472 states have (on average 1.2415254237288136) internal successors, (586), 474 states have internal predecessors, (586), 263 states have call successors, (263), 35 states have call predecessors, (263), 35 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2024-11-08 21:54:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1112 transitions. [2024-11-08 21:54:00,450 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1112 transitions. Word has length 235 [2024-11-08 21:54:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:00,450 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1112 transitions. [2024-11-08 21:54:00,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:54:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1112 transitions. [2024-11-08 21:54:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 21:54:00,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:00,452 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:00,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 21:54:00,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:54:00,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:00,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1642565052, now seen corresponding path program 1 times [2024-11-08 21:54:00,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:54:00,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199679875] [2024-11-08 21:54:00,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:54:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:54:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462065593] [2024-11-08 21:54:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:00,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:54:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:54:00,768 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:54:00,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 21:54:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:54:00,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:54:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:54:01,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:54:01,214 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:54:01,215 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:54:01,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:54:01,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:54:01,420 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:01,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:54:01,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:54:01 BoogieIcfgContainer [2024-11-08 21:54:01,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:54:01,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:54:01,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:54:01,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:54:01,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:53:45" (3/4) ... [2024-11-08 21:54:01,598 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:54:01,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:54:01,600 INFO L158 Benchmark]: Toolchain (without parser) took 17480.11ms. Allocated memory was 195.0MB in the beginning and 436.2MB in the end (delta: 241.2MB). Free memory was 126.8MB in the beginning and 337.2MB in the end (delta: -210.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,600 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:54:01,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 108.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.06ms. Allocated memory is still 195.0MB. Free memory was 108.8MB in the beginning and 165.0MB in the end (delta: -56.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,601 INFO L158 Benchmark]: Boogie Preprocessor took 135.89ms. Allocated memory is still 195.0MB. Free memory was 165.0MB in the beginning and 158.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,601 INFO L158 Benchmark]: RCFGBuilder took 679.94ms. Allocated memory is still 195.0MB. Free memory was 158.0MB in the beginning and 128.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,602 INFO L158 Benchmark]: TraceAbstraction took 16169.74ms. Allocated memory was 195.0MB in the beginning and 436.2MB in the end (delta: 241.2MB). Free memory was 127.8MB in the beginning and 338.3MB in the end (delta: -210.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,602 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 436.2MB. Free memory was 338.3MB in the beginning and 337.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:54:01,604 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.18ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 108.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.06ms. Allocated memory is still 195.0MB. Free memory was 108.8MB in the beginning and 165.0MB in the end (delta: -56.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.89ms. Allocated memory is still 195.0MB. Free memory was 165.0MB in the beginning and 158.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 679.94ms. Allocated memory is still 195.0MB. Free memory was 158.0MB in the beginning and 128.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16169.74ms. Allocated memory was 195.0MB in the beginning and 436.2MB in the end (delta: 241.2MB). Free memory was 127.8MB in the beginning and 338.3MB in the end (delta: -210.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 436.2MB. Free memory was 338.3MB in the beginning and 337.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryFLOATComparisonOperation at line 216, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] float var_1_28 = 255.5; [L44] float var_1_29 = 7.5; [L45] float var_1_30 = 9.8; [L46] unsigned char var_1_31 = 4; [L47] signed long int var_1_32 = 1; [L48] unsigned char var_1_33 = 2; [L49] unsigned short int var_1_34 = 1; [L50] unsigned long int var_1_35 = 10; [L51] unsigned char var_1_36 = 10; [L52] unsigned char var_1_37 = 128; [L53] unsigned char var_1_38 = 16; [L54] unsigned char var_1_39 = 0; [L55] unsigned short int var_1_40 = 10; [L56] unsigned short int var_1_41 = 128; [L57] unsigned short int var_1_42 = 40597; [L58] signed short int last_1_var_1_1 = 16; [L59] unsigned char last_1_var_1_6 = 10; [L60] unsigned char last_1_var_1_8 = 1; [L61] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L220] isInitial = 1 [L221] FCALL initially() [L222] COND TRUE 1 [L223] CALL updateLastVariables() [L210] last_1_var_1_1 = var_1_1 [L211] last_1_var_1_6 = var_1_6 [L212] last_1_var_1_8 = var_1_8 [L213] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L223] RET updateLastVariables() [L224] CALL updateVariables() [L151] var_1_5 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L152] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L153] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L155] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L156] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L158] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L159] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L160] var_1_12 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L162] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L163] var_1_15 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L164] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L165] var_1_16 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L166] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L167] var_1_20 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L168] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L169] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L170] var_1_22 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L171] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L172] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L173] var_1_23 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L175] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L175] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L176] var_1_24 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L177] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L178] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L178] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L182] var_1_27 = __VERIFIER_nondet_long() [L183] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L183] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L184] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L184] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L185] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L187] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L188] var_1_29 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L189] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L190] var_1_32 = __VERIFIER_nondet_long() [L191] CALL assume_abort_if_not(var_1_32 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L191] RET assume_abort_if_not(var_1_32 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L192] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L193] var_1_33 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L194] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L195] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L195] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L196] var_1_37 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L197] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L198] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L198] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L199] var_1_38 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L200] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L201] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L201] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_uchar() [L203] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L203] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L204] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L204] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L205] var_1_42 = __VERIFIER_nondet_ushort() [L206] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L206] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L207] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L207] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L224] RET updateVariables() [L225] CALL step() [L65] signed long int stepLocal_6 = last_1_var_1_1; [L66] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L67] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L68] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L71] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L76] COND TRUE (- var_1_28) < ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) [L77] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L79] COND TRUE \read(var_1_25) [L80] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L82] COND TRUE \read(var_1_25) [L83] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L87] COND FALSE !(var_1_33 <= (~ var_1_34)) [L92] var_1_41 = var_1_36 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L94] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L97] COND TRUE var_1_5 >= -2 [L98] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L100] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_24)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_24))) <= var_1_32 [L101] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L103] COND TRUE (- var_1_36) != var_1_34 [L104] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L106] unsigned char stepLocal_4 = var_1_6; [L107] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L108] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L109] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L110] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L117] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L118] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L120] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L121] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L124] COND TRUE var_1_31 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) [L125] var_1_34 = ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_33)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_33))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L127] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L128] COND TRUE \read(var_1_19) [L129] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L135] COND TRUE var_1_22 || var_1_23 [L136] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L138] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L139] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L140] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L147] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L225] RET step() [L226] CALL, EXPR property() [L216-L217] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L226] RET, EXPR property() [L226] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=254, var_1_37=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=254, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 9, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1243 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1186 mSDsluCounter, 4112 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2851 mSDsCounter, 554 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2157 IncrementalHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 554 mSolverCounterUnsat, 1261 mSDtfsCounter, 2157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2402 GetRequests, 2294 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred in iteration=8, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 418 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3289 NumberOfCodeBlocks, 3289 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2805 ConstructedInterpolants, 1 QuantifiedInterpolants, 11809 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2162 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 31122/31968 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:54:01,653 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/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.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 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:54:03,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:54:03,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:54:04,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:54:04,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:54:04,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:54:04,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:54:04,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:54:04,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:54:04,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:54:04,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:54:04,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:54:04,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:54:04,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:54:04,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:54:04,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:54:04,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:54:04,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:54:04,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:54:04,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:54:04,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:54:04,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:54:04,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:54:04,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:54:04,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:54:04,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:54:04,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:54:04,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:54:04,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:54:04,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:54:04,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:54:04,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:54:04,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:54:04,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:54:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:54:04,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:54:04,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:54:04,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:54:04,047 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:54:04,047 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:54:04,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:54:04,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:54:04,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:54:04,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:54:04,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd [2024-11-08 21:54:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:54:04,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:54:04,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:54:04,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:54:04,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:54:04,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:54:05,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:54:06,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:54:06,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:54:06,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0b3f2b3/f96d9a75015e4a18b52d321cf405211d/FLAGe403cbf69 [2024-11-08 21:54:06,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0b3f2b3/f96d9a75015e4a18b52d321cf405211d [2024-11-08 21:54:06,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:54:06,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:54:06,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:54:06,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:54:06,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:54:06,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:06,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c558c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06, skipping insertion in model container [2024-11-08 21:54:06,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:06,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:54:06,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2024-11-08 21:54:06,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:54:06,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:54:06,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2024-11-08 21:54:06,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:54:06,917 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:54:06,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06 WrapperNode [2024-11-08 21:54:06,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:54:06,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:54:06,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:54:06,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:54:06,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:06,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:06,989 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-11-08 21:54:06,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:54:06,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:54:06,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:54:06,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:54:07,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,038 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]. [2024-11-08 21:54:07,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:54:07,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:54:07,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:54:07,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:54:07,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (1/1) ... [2024-11-08 21:54:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:54:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:54:07,123 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) [2024-11-08 21:54:07,130 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 [2024-11-08 21:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:54:07,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:54:07,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:54:07,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:54:07,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:54:07,918 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 21:54:07,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:54:07,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:54:07,934 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:54:07,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:54:07 BoogieIcfgContainer [2024-11-08 21:54:07,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:54:07,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:54:07,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:54:07,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:54:07,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:54:06" (1/3) ... [2024-11-08 21:54:07,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4575f4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:54:07, skipping insertion in model container [2024-11-08 21:54:07,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:54:06" (2/3) ... [2024-11-08 21:54:07,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4575f4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:54:07, skipping insertion in model container [2024-11-08 21:54:07,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:54:07" (3/3) ... [2024-11-08 21:54:07,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2024-11-08 21:54:07,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:54:07,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:54:08,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:54:08,028 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;@436e7e85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:54:08,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:54:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:54:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 21:54:08,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:08,053 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:08,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:08,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -81267385, now seen corresponding path program 1 times [2024-11-08 21:54:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632245110] [2024-11-08 21:54:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:08,076 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 [2024-11-08 21:54:08,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:08,079 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) [2024-11-08 21:54:08,080 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 [2024-11-08 21:54:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:08,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:54:08,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2024-11-08 21:54:08,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:54:08,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632245110] [2024-11-08 21:54:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632245110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:54:08,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:54:08,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:54:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635333904] [2024-11-08 21:54:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:54:08,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:54:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:54:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:54:08,599 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:54:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:08,639 INFO L93 Difference]: Finished difference Result 194 states and 351 transitions. [2024-11-08 21:54:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:54:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 234 [2024-11-08 21:54:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:08,648 INFO L225 Difference]: With dead ends: 194 [2024-11-08 21:54:08,648 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 21:54:08,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:54:08,655 INFO L432 NwaCegarLoop]: 151 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, 151 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 [2024-11-08 21:54:08,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:54:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 21:54:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 21:54:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:54:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2024-11-08 21:54:08,704 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 234 [2024-11-08 21:54:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:08,705 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2024-11-08 21:54:08,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 21:54:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2024-11-08 21:54:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 21:54:08,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:08,711 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:08,729 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 [2024-11-08 21:54:08,915 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 [2024-11-08 21:54:08,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1449879045, now seen corresponding path program 1 times [2024-11-08 21:54:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612039015] [2024-11-08 21:54:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:08,919 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 [2024-11-08 21:54:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:08,922 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) [2024-11-08 21:54:08,924 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 [2024-11-08 21:54:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:09,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 21:54:09,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:54:09,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:54:09,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612039015] [2024-11-08 21:54:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612039015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:54:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:54:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:54:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343455802] [2024-11-08 21:54:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:54:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:54:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:54:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:54:09,731 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:10,107 INFO L93 Difference]: Finished difference Result 283 states and 448 transitions. [2024-11-08 21:54:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:54:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-11-08 21:54:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:10,121 INFO L225 Difference]: With dead ends: 283 [2024-11-08 21:54:10,122 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 21:54:10,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:54:10,127 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:10,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 435 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:54:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 21:54:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2024-11-08 21:54:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 21:54:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2024-11-08 21:54:10,180 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 251 transitions. Word has length 234 [2024-11-08 21:54:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:10,181 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 251 transitions. [2024-11-08 21:54:10,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 251 transitions. [2024-11-08 21:54:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:54:10,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:10,189 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:10,202 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 21:54:10,389 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 [2024-11-08 21:54:10,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:10,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1103232352, now seen corresponding path program 1 times [2024-11-08 21:54:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883715901] [2024-11-08 21:54:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:10,394 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 [2024-11-08 21:54:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:10,396 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) [2024-11-08 21:54:10,397 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 [2024-11-08 21:54:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:10,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:54:10,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2024-11-08 21:54:10,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:54:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-08 21:54:11,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:11,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883715901] [2024-11-08 21:54:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883715901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:54:11,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:54:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 21:54:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999988597] [2024-11-08 21:54:11,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:54:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:54:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:54:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:54:11,216 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 21:54:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:11,548 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2024-11-08 21:54:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:54:11,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 235 [2024-11-08 21:54:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:11,552 INFO L225 Difference]: With dead ends: 265 [2024-11-08 21:54:11,552 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 21:54:11,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:54:11,557 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 76 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:11,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 247 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:54:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 21:54:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2024-11-08 21:54:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 21:54:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2024-11-08 21:54:11,586 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 235 [2024-11-08 21:54:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:11,587 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2024-11-08 21:54:11,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-08 21:54:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2024-11-08 21:54:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:54:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:11,591 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:11,605 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 [2024-11-08 21:54:11,791 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 [2024-11-08 21:54:11,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 884377634, now seen corresponding path program 1 times [2024-11-08 21:54:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794208559] [2024-11-08 21:54:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:11,794 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 [2024-11-08 21:54:11,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:11,797 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) [2024-11-08 21:54:11,798 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 [2024-11-08 21:54:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:12,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:54:12,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:54:12,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:54:12,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794208559] [2024-11-08 21:54:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794208559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:54:12,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:54:12,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:54:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412813626] [2024-11-08 21:54:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:54:12,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:54:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:12,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:54:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:54:12,131 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:12,258 INFO L93 Difference]: Finished difference Result 265 states and 404 transitions. [2024-11-08 21:54:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:54:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2024-11-08 21:54:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:12,271 INFO L225 Difference]: With dead ends: 265 [2024-11-08 21:54:12,271 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 21:54:12,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:54:12,273 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:12,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:54:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 21:54:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-08 21:54:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 89 states have internal predecessors, (106), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 21:54:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2024-11-08 21:54:12,310 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 235 [2024-11-08 21:54:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:12,313 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2024-11-08 21:54:12,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2024-11-08 21:54:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:54:12,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:12,318 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:12,334 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 (5)] Ended with exit code 0 [2024-11-08 21:54:12,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2024-11-08 21:54:12,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:12,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1585442212, now seen corresponding path program 1 times [2024-11-08 21:54:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221012844] [2024-11-08 21:54:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:12,521 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 [2024-11-08 21:54:12,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:12,524 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2024-11-08 21:54:12,525 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 (6)] Waiting until timeout for monitored process [2024-11-08 21:54:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:12,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:54:12,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-08 21:54:13,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:54:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2024-11-08 21:54:14,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221012844] [2024-11-08 21:54:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221012844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:54:14,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:54:14,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-08 21:54:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791483232] [2024-11-08 21:54:14,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:54:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 21:54:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 21:54:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:54:14,019 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-11-08 21:54:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:15,307 INFO L93 Difference]: Finished difference Result 403 states and 584 transitions. [2024-11-08 21:54:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 21:54:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 235 [2024-11-08 21:54:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:15,311 INFO L225 Difference]: With dead ends: 403 [2024-11-08 21:54:15,311 INFO L226 Difference]: Without dead ends: 306 [2024-11-08 21:54:15,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 21:54:15,313 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 211 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:15,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 611 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 21:54:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-08 21:54:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2024-11-08 21:54:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-08 21:54:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2024-11-08 21:54:15,361 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 235 [2024-11-08 21:54:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2024-11-08 21:54:15,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-11-08 21:54:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2024-11-08 21:54:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:54:15,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:15,368 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:15,386 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 (6)] Ended with exit code 0 [2024-11-08 21:54:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2024-11-08 21:54:15,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -103501530, now seen corresponding path program 1 times [2024-11-08 21:54:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709282994] [2024-11-08 21:54:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:15,577 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 [2024-11-08 21:54:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:15,579 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2024-11-08 21:54:15,581 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 (7)] Waiting until timeout for monitored process [2024-11-08 21:54:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:15,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:54:15,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-11-08 21:54:16,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:54:17,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709282994] [2024-11-08 21:54:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709282994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:54:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723779946] [2024-11-08 21:54:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:17,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:54:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:54:17,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:54:17,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-08 21:54:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:18,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:54:18,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:54:18,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:54:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723779946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:54:18,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:54:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-08 21:54:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393139240] [2024-11-08 21:54:18,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:54:18,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:54:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:54:18,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:54:18,719 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:20,522 INFO L93 Difference]: Finished difference Result 825 states and 1198 transitions. [2024-11-08 21:54:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:54:20,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2024-11-08 21:54:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:20,538 INFO L225 Difference]: With dead ends: 825 [2024-11-08 21:54:20,539 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 21:54:20,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:54:20,541 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 172 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:20,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 658 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 21:54:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 21:54:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 546. [2024-11-08 21:54:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 334 states have (on average 1.251497005988024) internal successors, (418), 336 states have internal predecessors, (418), 189 states have call successors, (189), 22 states have call predecessors, (189), 22 states have return successors, (189), 187 states have call predecessors, (189), 189 states have call successors, (189) [2024-11-08 21:54:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 796 transitions. [2024-11-08 21:54:20,610 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 796 transitions. Word has length 235 [2024-11-08 21:54:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:20,610 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 796 transitions. [2024-11-08 21:54:20,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 796 transitions. [2024-11-08 21:54:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 21:54:20,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:20,615 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:20,632 INFO L540 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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 21:54:20,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-08 21:54:21,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:54:21,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2097646236, now seen corresponding path program 1 times [2024-11-08 21:54:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682399680] [2024-11-08 21:54:21,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:21,018 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 [2024-11-08 21:54:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:21,019 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2024-11-08 21:54:21,026 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 (9)] Waiting until timeout for monitored process [2024-11-08 21:54:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:21,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:54:21,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-11-08 21:54:22,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:54:22,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:54:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682399680] [2024-11-08 21:54:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682399680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:54:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [771359995] [2024-11-08 21:54:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:22,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:54:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:54:22,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:54:22,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-08 21:54:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:23,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:54:23,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:54:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-08 21:54:24,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:54:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [771359995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:54:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:54:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-08 21:54:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269215892] [2024-11-08 21:54:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:54:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:54:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:54:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:54:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:54:24,349 INFO L87 Difference]: Start difference. First operand 546 states and 796 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:54:26,451 INFO L93 Difference]: Finished difference Result 993 states and 1450 transitions. [2024-11-08 21:54:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:54:26,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2024-11-08 21:54:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:54:26,460 INFO L225 Difference]: With dead ends: 993 [2024-11-08 21:54:26,460 INFO L226 Difference]: Without dead ends: 786 [2024-11-08 21:54:26,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:54:26,463 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 103 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:54:26,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 576 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 21:54:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-08 21:54:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 751. [2024-11-08 21:54:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 457 states have (on average 1.24945295404814) internal successors, (571), 459 states have internal predecessors, (571), 263 states have call successors, (263), 30 states have call predecessors, (263), 30 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2024-11-08 21:54:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1097 transitions. [2024-11-08 21:54:26,556 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1097 transitions. Word has length 235 [2024-11-08 21:54:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:54:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1097 transitions. [2024-11-08 21:54:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-08 21:54:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1097 transitions. [2024-11-08 21:54:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 21:54:26,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:54:26,561 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:54:26,578 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 (9)] Ended with exit code 0 [2024-11-08 21:54:26,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-08 21:54:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:54:26,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:54:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:54:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1642565052, now seen corresponding path program 1 times [2024-11-08 21:54:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:54:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11458579] [2024-11-08 21:54:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:54:26,963 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 [2024-11-08 21:54:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:54:26,965 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2024-11-08 21:54:26,965 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 (11)] Waiting until timeout for monitored process [2024-11-08 21:54:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:54:27,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 21:54:27,254 INFO L278 TraceCheckSpWp]: Computing forward predicates...