./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_loopvsstraightlinecode_100-while_file-39.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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:13:50,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:13:50,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:13:50,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:13:50,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:13:50,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:13:50,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:13:50,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:13:50,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:13:50,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:13:50,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:13:50,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:13:50,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:13:50,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:13:50,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:13:50,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:13:50,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:13:50,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:13:50,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:13:50,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:13:50,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:13:50,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:13:50,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:13:50,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:13:50,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:13:50,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:13:50,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:13:50,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:13:50,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:13:50,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:13:50,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:13:50,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:13:50,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:50,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:13:50,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:13:50,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:13:50,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:13:50,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:13:50,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:13:50,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:13:50,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:13:50,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:13:50,634 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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-11-10 07:13:50,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:13:50,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:13:50,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:13:50,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:13:50,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:13:50,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:13:52,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:13:52,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:13:52,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:13:52,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b04912f/3ca2e8eb759a4e84a60eb1fb5f79519e/FLAG4891e075b [2024-11-10 07:13:52,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b04912f/3ca2e8eb759a4e84a60eb1fb5f79519e [2024-11-10 07:13:52,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:13:52,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:13:52,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:52,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:13:52,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:13:52,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43262b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52, skipping insertion in model container [2024-11-10 07:13:52,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:13:52,593 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-11-10 07:13:52,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:52,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:13:52,710 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-11-10 07:13:52,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:52,759 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:13:52,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52 WrapperNode [2024-11-10 07:13:52,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:52,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:52,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:13:52,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:13:52,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,820 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-10 07:13:52,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:52,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:13:52,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:13:52,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:13:52,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,867 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-10 07:13:52,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:13:52,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:13:52,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:13:52,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:13:52,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (1/1) ... [2024-11-10 07:13:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:52,942 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-10 07:13:52,944 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-10 07:13:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:13:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:13:52,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:13:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:13:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:13:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:13:53,065 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:13:53,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:13:53,486 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc property_#t~bitwise20#1; [2024-11-10 07:13:53,530 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 07:13:53,531 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:13:53,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:13:53,556 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 07:13:53,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:53 BoogieIcfgContainer [2024-11-10 07:13:53,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:13:53,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:13:53,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:13:53,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:13:53,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:13:52" (1/3) ... [2024-11-10 07:13:53,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a61e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:53, skipping insertion in model container [2024-11-10 07:13:53,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:52" (2/3) ... [2024-11-10 07:13:53,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a61e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:53, skipping insertion in model container [2024-11-10 07:13:53,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:53" (3/3) ... [2024-11-10 07:13:53,572 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:13:53,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:13:53,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:13:53,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:13:53,650 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;@3939e583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:13:53,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:13:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:13:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 07:13:53,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:53,669 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:53,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1663607478, now seen corresponding path program 1 times [2024-11-10 07:13:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601340554] [2024-11-10 07:13:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:53,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:13:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:13:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:13:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:13:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:13:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:13:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:13:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:13:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:13:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:13:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:13:54,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:54,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601340554] [2024-11-10 07:13:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601340554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:13:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324035253] [2024-11-10 07:13:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:54,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:13:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:13:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:13:54,208 INFO L87 Difference]: Start difference. First operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 07:13:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:54,271 INFO L93 Difference]: Finished difference Result 178 states and 299 transitions. [2024-11-10 07:13:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:13:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 168 [2024-11-10 07:13:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:54,291 INFO L225 Difference]: With dead ends: 178 [2024-11-10 07:13:54,291 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 07:13:54,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10 07:13:54,301 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:54,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:13:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 07:13:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 07:13:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:13:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-10 07:13:54,356 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 168 [2024-11-10 07:13:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:54,358 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-10 07:13:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 07:13:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-10 07:13:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 07:13:54,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:54,361 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:54,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:13:54,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash -295032112, now seen corresponding path program 1 times [2024-11-10 07:13:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084196003] [2024-11-10 07:13:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:13:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:13:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:13:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:13:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:13:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:13:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:13:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:13:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:13:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:13:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:13:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084196003] [2024-11-10 07:13:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084196003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100024699] [2024-11-10 07:13:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:55,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:55,322 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-10 07:13:55,325 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-10 07:13:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:55,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:13:55,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-10 07:13:55,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:13:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:13:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100024699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:13:55,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:13:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 07:13:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643217191] [2024-11-10 07:13:55,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:13:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:13:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:13:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:13:55,980 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-10 07:13:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:56,224 INFO L93 Difference]: Finished difference Result 179 states and 268 transitions. [2024-11-10 07:13:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:13:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 168 [2024-11-10 07:13:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:56,230 INFO L225 Difference]: With dead ends: 179 [2024-11-10 07:13:56,230 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 07:13:56,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:13:56,231 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 191 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:56,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 252 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:13:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 07:13:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-10 07:13:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:13:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-10 07:13:56,248 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 168 [2024-11-10 07:13:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:56,248 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-10 07:13:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-10 07:13:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-10 07:13:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:13:56,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:56,253 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:56,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:13:56,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:56,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 647167608, now seen corresponding path program 1 times [2024-11-10 07:13:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211552146] [2024-11-10 07:13:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:13:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:13:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:13:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:13:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:13:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:13:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:13:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:13:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:13:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:13:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:13:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:56,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211552146] [2024-11-10 07:13:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211552146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:56,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:13:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111760625] [2024-11-10 07:13:56,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:56,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:13:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:13:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:13:56,822 INFO L87 Difference]: Start difference. First operand 92 states and 134 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:13:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:56,938 INFO L93 Difference]: Finished difference Result 254 states and 365 transitions. [2024-11-10 07:13:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:13:56,938 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-10 07:13:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:56,940 INFO L225 Difference]: With dead ends: 254 [2024-11-10 07:13:56,940 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 07:13:56,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:13:56,942 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 219 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:56,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 259 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:13:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 07:13:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 107. [2024-11-10 07:13:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:13:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-10 07:13:56,974 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 169 [2024-11-10 07:13:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:56,976 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-10 07:13:56,976 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:13:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-10 07:13:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:13:56,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:56,979 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:13:56,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 136633431, now seen corresponding path program 1 times [2024-11-10 07:13:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405898687] [2024-11-10 07:13:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:13:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:13:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:13:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:13:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:13:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:13:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:13:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:13:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:13:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:13:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:13:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405898687] [2024-11-10 07:13:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405898687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647116964] [2024-11-10 07:13:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:57,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:57,362 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-10 07:13:57,364 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-10 07:13:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:57,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:13:57,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-10 07:13:57,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:13:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:13:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647116964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:13:57,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:13:57,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:13:57,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200272888] [2024-11-10 07:13:57,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:13:57,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:13:57,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:57,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:13:57,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:13:57,813 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:13:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:58,009 INFO L93 Difference]: Finished difference Result 219 states and 308 transitions. [2024-11-10 07:13:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:13:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 169 [2024-11-10 07:13:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:58,013 INFO L225 Difference]: With dead ends: 219 [2024-11-10 07:13:58,013 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 07:13:58,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:13:58,014 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 136 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:58,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 247 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:13:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 07:13:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-10 07:13:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:13:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-11-10 07:13:58,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 169 [2024-11-10 07:13:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:58,036 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-11-10 07:13:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:13:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-11-10 07:13:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:13:58,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:58,041 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:58,061 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-10 07:13:58,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 07:13:58,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:58,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash 678187415, now seen corresponding path program 1 times [2024-11-10 07:13:58,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:58,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148273678] [2024-11-10 07:13:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:13:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:13:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:13:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:13:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:13:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:13:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:13:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:13:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:13:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:13:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:13:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148273678] [2024-11-10 07:13:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148273678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512830813] [2024-11-10 07:13:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:59,650 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-10 07:13:59,651 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-10 07:13:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:59,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 07:13:59,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 157 proven. 186 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-10 07:14:00,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-10 07:14:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512830813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:01,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:14:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 31 [2024-11-10 07:14:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048425316] [2024-11-10 07:14:01,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:01,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 07:14:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:01,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 07:14:01,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2024-11-10 07:14:01,703 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 31 states, 31 states have (on average 4.67741935483871) internal successors, (145), 30 states have internal predecessors, (145), 8 states have call successors, (71), 4 states have call predecessors, (71), 8 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-10 07:14:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:12,465 INFO L93 Difference]: Finished difference Result 703 states and 927 transitions. [2024-11-10 07:14:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-10 07:14:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.67741935483871) internal successors, (145), 30 states have internal predecessors, (145), 8 states have call successors, (71), 4 states have call predecessors, (71), 8 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) Word has length 169 [2024-11-10 07:14:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:12,471 INFO L225 Difference]: With dead ends: 703 [2024-11-10 07:14:12,472 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 07:14:12,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4008 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2331, Invalid=10779, Unknown=0, NotChecked=0, Total=13110 [2024-11-10 07:14:12,479 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 1430 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:12,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 1887 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 07:14:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 07:14:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 218. [2024-11-10 07:14:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 155 states have (on average 1.238709677419355) internal successors, (192), 155 states have internal predecessors, (192), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:14:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 288 transitions. [2024-11-10 07:14:12,535 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 288 transitions. Word has length 169 [2024-11-10 07:14:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:12,536 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 288 transitions. [2024-11-10 07:14:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.67741935483871) internal successors, (145), 30 states have internal predecessors, (145), 8 states have call successors, (71), 4 states have call predecessors, (71), 8 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-10 07:14:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 288 transitions. [2024-11-10 07:14:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:14:12,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:12,539 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:12,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 07:14:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:12,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 423450870, now seen corresponding path program 1 times [2024-11-10 07:14:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064632707] [2024-11-10 07:14:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:14:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:14:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:14:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:14:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:14:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:14:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:14:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:14:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:14:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:14:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:14:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:14:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:14:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:14:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064632707] [2024-11-10 07:14:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064632707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:14:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601448608] [2024-11-10 07:14:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:14:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:14:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:14:12,949 INFO L87 Difference]: Start difference. First operand 218 states and 288 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:14:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:13,002 INFO L93 Difference]: Finished difference Result 436 states and 575 transitions. [2024-11-10 07:14:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:14:13,004 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-10 07:14:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:13,005 INFO L225 Difference]: With dead ends: 436 [2024-11-10 07:14:13,005 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 07:14:13,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-10 07:14:13,007 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 66 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:13,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 459 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:14:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 07:14:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 112. [2024-11-10 07:14:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:14:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2024-11-10 07:14:13,022 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 169 [2024-11-10 07:14:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2024-11-10 07:14:13,023 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:14:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2024-11-10 07:14:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 07:14:13,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:13,024 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:14:13,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1847639888, now seen corresponding path program 1 times [2024-11-10 07:14:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900466154] [2024-11-10 07:14:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:14:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:14:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:14:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:14:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 07:14:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 07:14:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 07:14:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:14:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:14:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:14:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:14:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:14:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:14:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:14:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:14:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:14:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 07:14:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 07:14:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 96 proven. 144 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-10 07:14:14,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:14,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900466154] [2024-11-10 07:14:14,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900466154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:14,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319714354] [2024-11-10 07:14:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:14,517 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-10 07:14:14,518 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-10 07:14:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:14,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 07:14:14,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 559 proven. 195 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-11-10 07:14:16,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319714354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:31,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:14:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 36 [2024-11-10 07:14:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727253288] [2024-11-10 07:14:31,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:31,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 07:14:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 07:14:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=2465, Unknown=13, NotChecked=0, Total=3080 [2024-11-10 07:14:31,334 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 36 states, 36 states have (on average 3.5) internal successors, (126), 34 states have internal predecessors, (126), 12 states have call successors, (48), 8 states have call predecessors, (48), 11 states have return successors, (48), 11 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-10 07:14:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:35,900 INFO L93 Difference]: Finished difference Result 539 states and 682 transitions. [2024-11-10 07:14:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-10 07:14:35,901 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.5) internal successors, (126), 34 states have internal predecessors, (126), 12 states have call successors, (48), 8 states have call predecessors, (48), 11 states have return successors, (48), 11 states have call predecessors, (48), 12 states have call successors, (48) Word has length 170 [2024-11-10 07:14:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:35,903 INFO L225 Difference]: With dead ends: 539 [2024-11-10 07:14:35,903 INFO L226 Difference]: Without dead ends: 430 [2024-11-10 07:14:35,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1969, Invalid=7524, Unknown=13, NotChecked=0, Total=9506 [2024-11-10 07:14:35,906 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1067 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 223 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:35,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1666 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2122 Invalid, 10 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 07:14:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-10 07:14:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 360. [2024-11-10 07:14:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 259 states have (on average 1.223938223938224) internal successors, (317), 259 states have internal predecessors, (317), 72 states have call successors, (72), 28 states have call predecessors, (72), 28 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 07:14:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 461 transitions. [2024-11-10 07:14:35,953 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 461 transitions. Word has length 170 [2024-11-10 07:14:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:35,954 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 461 transitions. [2024-11-10 07:14:35,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5) internal successors, (126), 34 states have internal predecessors, (126), 12 states have call successors, (48), 8 states have call predecessors, (48), 11 states have return successors, (48), 11 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-10 07:14:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 461 transitions. [2024-11-10 07:14:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 07:14:35,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:35,956 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:35,975 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-10 07:14:36,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:36,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1342081263, now seen corresponding path program 1 times [2024-11-10 07:14:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485319847] [2024-11-10 07:14:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404569488] [2024-11-10 07:14:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:36,297 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-10 07:14:36,297 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-10 07:14:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:36,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 07:14:36,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:14:36,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:14:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485319847] [2024-11-10 07:14:36,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:14:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404569488] [2024-11-10 07:14:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404569488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:36,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:14:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123500969] [2024-11-10 07:14:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:14:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:14:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:14:36,784 INFO L87 Difference]: Start difference. First operand 360 states and 461 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:14:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:37,006 INFO L93 Difference]: Finished difference Result 884 states and 1133 transitions. [2024-11-10 07:14:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:14:37,007 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2024-11-10 07:14:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:37,012 INFO L225 Difference]: With dead ends: 884 [2024-11-10 07:14:37,012 INFO L226 Difference]: Without dead ends: 527 [2024-11-10 07:14:37,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:14:37,016 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 111 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:37,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 482 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:14:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-10 07:14:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 454. [2024-11-10 07:14:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 318 states have (on average 1.1949685534591195) internal successors, (380), 318 states have internal predecessors, (380), 96 states have call successors, (96), 39 states have call predecessors, (96), 39 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 07:14:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 572 transitions. [2024-11-10 07:14:37,089 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 572 transitions. Word has length 170 [2024-11-10 07:14:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:37,089 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 572 transitions. [2024-11-10 07:14:37,089 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:14:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 572 transitions. [2024-11-10 07:14:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 07:14:37,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:37,090 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:37,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 07:14:37,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:37,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:37,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1275074510, now seen corresponding path program 1 times [2024-11-10 07:14:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239131092] [2024-11-10 07:14:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:37,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545799877] [2024-11-10 07:14:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:37,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:37,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:37,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:14:37,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 07:14:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:14:37,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:14:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:14:37,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:14:37,738 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:14:37,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:14:37,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 07:14:37,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:37,945 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:14:38,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:14:38,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:14:38 BoogieIcfgContainer [2024-11-10 07:14:38,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:14:38,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:14:38,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:14:38,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:14:38,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:53" (3/4) ... [2024-11-10 07:14:38,045 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:14:38,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:14:38,046 INFO L158 Benchmark]: Toolchain (without parser) took 45637.74ms. Allocated memory was 146.8MB in the beginning and 283.1MB in the end (delta: 136.3MB). Free memory was 73.6MB in the beginning and 135.1MB in the end (delta: -61.5MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,046 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.03ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 153.2MB in the end (delta: -79.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.04ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 147.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: Boogie Preprocessor took 84.82ms. Allocated memory is still 188.7MB. Free memory was 147.9MB in the beginning and 138.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: IcfgBuilder took 651.60ms. Allocated memory is still 188.7MB. Free memory was 138.5MB in the beginning and 104.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: TraceAbstraction took 44478.17ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 103.9MB in the beginning and 135.1MB in the end (delta: -31.3MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-10 07:14:38,047 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 283.1MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:14:38,048 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.16ms. Allocated memory is still 146.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.03ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 153.2MB in the end (delta: -79.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.04ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 147.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.82ms. Allocated memory is still 188.7MB. Free memory was 147.9MB in the beginning and 138.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 651.60ms. Allocated memory is still 188.7MB. Free memory was 138.5MB in the beginning and 104.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44478.17ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 103.9MB in the beginning and 135.1MB in the end (delta: -31.3MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 283.1MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned short int var_1_4 = 8; [L24] unsigned short int var_1_5 = 5; [L25] unsigned long int var_1_6 = 256; [L26] float var_1_7 = 9999999999999.2; [L27] float var_1_8 = 499.5; [L28] float var_1_9 = 64.4; [L29] float var_1_10 = 0.5; [L30] float var_1_11 = 5.8; [L31] float var_1_12 = 16.75; [L32] float var_1_13 = 99.5; [L33] signed short int var_1_15 = -10; [L34] unsigned char var_1_17 = 0; [L35] unsigned long int var_1_19 = 2743323310; [L36] unsigned long int var_1_20 = 4162860161; [L37] unsigned char var_1_21 = 0; [L38] double var_1_22 = 99.7; [L39] unsigned long int var_1_23 = 8; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned char var_1_27 = 32; [L44] unsigned char var_1_28 = 200; [L45] float var_1_29 = 16.1; [L46] float var_1_30 = 7.9; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 1; [L49] unsigned char var_1_33 = 8; [L50] signed short int last_1_var_1_15 = -10; [L51] double last_1_var_1_22 = 99.7; [L52] unsigned long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 1; [L54] unsigned char last_1_var_1_27 = 32; [L55] unsigned char last_1_var_1_31 = 0; VAL [isInitial=0, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_27 = var_1_27 [L193] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L148] RET assume_abort_if_not(var_1_4 >= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] CALL assume_abort_if_not(var_1_4 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] RET assume_abort_if_not(var_1_4 <= 17) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] CALL assume_abort_if_not(var_1_5 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] RET assume_abort_if_not(var_1_5 <= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L153] var_1_8 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L154] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L155] var_1_9 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L156] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L157] var_1_10 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L158] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L159] var_1_11 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L160] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L161] var_1_12 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L162] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L163] var_1_13 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L164] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L167] RET assume_abort_if_not(var_1_19 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L168] var_1_20 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L169] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L170] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L170] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L173] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L173] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L174] var_1_25 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_25 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L175] RET assume_abort_if_not(var_1_25 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L176] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L176] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L178] RET assume_abort_if_not(var_1_26 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L179] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L179] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L181] RET assume_abort_if_not(var_1_28 >= 190) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L182] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L182] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L183] var_1_32 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L184] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L185] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L185] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=256, var_1_7=49999999999996/5] [L204] RET updateVariables() [L205] CALL step() [L59] COND TRUE (var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24)))) [L60] var_1_6 = 200u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L62] COND FALSE !(\read(last_1_var_1_31)) [L73] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L75] COND FALSE !(\read(var_1_17)) [L78] var_1_31 = (! 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L80] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L80] unsigned long int stepLocal_0 = (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5); [L81] COND FALSE !(stepLocal_0 <= -128) [L84] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L86] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_4=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5] [L87] COND TRUE stepLocal_4 || (last_1_var_1_22 <= var_1_12) [L88] var_1_22 = ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L92] signed long int stepLocal_6 = (((var_1_25) > (256)) ? (var_1_25) : (256)); VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_6=256, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L93] COND TRUE var_1_5 <= stepLocal_6 [L94] var_1_27 = ((var_1_28 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L98] var_1_29 = (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L99] COND TRUE var_1_19 != 25u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L100] COND TRUE ! var_1_21 [L101] var_1_30 = var_1_8 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L106] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L111] signed long int stepLocal_5 = var_1_33 % var_1_4; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_5=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L112] COND FALSE !(stepLocal_5 > var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L115] unsigned long int stepLocal_3 = var_1_6; [L116] signed long int stepLocal_2 = 128; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, stepLocal_3=200, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_1 > stepLocal_3) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L120] COND TRUE var_1_33 != stepLocal_2 [L121] var_1_15 = (var_1_5 - 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L126] COND FALSE !(((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L137] signed long int stepLocal_1 = var_1_33 + var_1_5; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_1=16, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L138] COND TRUE stepLocal_1 > var_1_24 [L139] var_1_7 = (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L205] RET step() [L206] CALL, EXPR property() [L196] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L196-L197] return (((((((((((((((last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5)) <= -128) ? (var_1_1 == ((unsigned char) (var_1_5 + var_1_4))) : (var_1_1 == ((unsigned char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (((var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24))))) ? (var_1_6 == ((unsigned long int) 200u)) : 1)) && (((var_1_33 + var_1_5) > var_1_24) ? (var_1_7 == ((float) (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))))) : ((! var_1_31) ? (var_1_7 == ((float) ((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13))))) : 1))) && ((var_1_1 > var_1_6) ? (var_1_15 == ((signed short int) last_1_var_1_15)) : ((var_1_33 != 128) ? (var_1_15 == ((signed short int) (var_1_5 - 1))) : (var_1_15 == ((signed short int) var_1_27))))) && (last_1_var_1_31 ? (last_1_var_1_31 ? (((((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))) - ((((10u) > (var_1_5)) ? (10u) : (var_1_5)))) != var_1_4) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0))) : (var_1_17 == ((unsigned char) var_1_21))) : (var_1_17 == ((unsigned char) var_1_21)))) && ((var_1_17 || (last_1_var_1_22 <= var_1_12)) ? (var_1_22 == ((double) ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))))) : (var_1_22 == ((double) (var_1_8 - var_1_9))))) && ((((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) ? (((5 * var_1_27) <= var_1_24) ? ((var_1_5 >= var_1_1) ? (var_1_23 == ((unsigned long int) var_1_24)) : (var_1_23 == ((unsigned long int) var_1_5))) : (var_1_23 == ((unsigned long int) var_1_4))) : 1)) && (((var_1_33 % var_1_4) > var_1_5) ? (var_1_24 == ((unsigned char) (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))) - var_1_4))) : 1)) && ((var_1_5 <= ((((var_1_25) > (256)) ? (var_1_25) : (256)))) ? (var_1_27 == ((unsigned char) ((var_1_28 - var_1_4) - var_1_5))) : (var_1_27 == ((unsigned char) (((((var_1_25) > (var_1_28)) ? (var_1_25) : (var_1_28))) - var_1_5))))) && (var_1_29 == ((float) (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13))))))) && ((var_1_19 != 25u) ? ((! var_1_21) ? (var_1_30 == ((float) var_1_8)) : 1) : (var_1_30 == ((float) (var_1_10 - var_1_9))))) && (var_1_17 ? (var_1_31 == ((unsigned char) (! var_1_32))) : (var_1_31 == ((unsigned char) (! 1))))) && (var_1_31 ? (((var_1_6 / var_1_25) <= var_1_4) ? (var_1_33 == ((unsigned char) var_1_5)) : 1) : 1) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=65544, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.3s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 3246 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3220 mSDsluCounter, 5383 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4265 mSDsCounter, 869 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5457 IncrementalHoareTripleChecker+Invalid, 6336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 869 mSolverCounterUnsat, 1118 mSDtfsCounter, 5457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2067 GetRequests, 1827 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6418 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=8, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 704 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 2538 NumberOfCodeBlocks, 2538 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2519 ConstructedInterpolants, 6 QuantifiedInterpolants, 14273 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2057 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 15654/16560 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-10 07:14:38,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_100-while_file-39.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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:14:39,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:14:40,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:14:40,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:14:40,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:14:40,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:14:40,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:14:40,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:14:40,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:14:40,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:14:40,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:14:40,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:14:40,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:14:40,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:14:40,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:14:40,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:14:40,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:14:40,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:14:40,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:14:40,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:14:40,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:14:40,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:14:40,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:14:40,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:14:40,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:14:40,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:14:40,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:14:40,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:14:40,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:14:40,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:14:40,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:14:40,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:14:40,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:14:40,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:14:40,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:40,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:14:40,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:14:40,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:14:40,093 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:14:40,093 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:14:40,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:14:40,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:14:40,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:14:40,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:14:40,094 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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-11-10 07:14:40,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:14:40,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:14:40,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:14:40,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:14:40,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:14:40,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:14:41,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:14:41,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:14:41,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:14:42,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5164f2b5a/161e8ad8f56e4b55a51b7e1a565f0dc2/FLAG89d4c1d26 [2024-11-10 07:14:42,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5164f2b5a/161e8ad8f56e4b55a51b7e1a565f0dc2 [2024-11-10 07:14:42,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:14:42,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:14:42,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:42,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:14:42,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:14:42,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0c3a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42, skipping insertion in model container [2024-11-10 07:14:42,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:14:42,597 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-11-10 07:14:42,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:42,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:14:42,715 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-11-10 07:14:42,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:42,795 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:14:42,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42 WrapperNode [2024-11-10 07:14:42,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:42,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:42,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:14:42,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:14:42,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,858 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-10 07:14:42,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:42,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:14:42,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:14:42,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:14:42,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,906 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-10 07:14:42,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:14:42,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:14:42,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:14:42,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:14:42,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (1/1) ... [2024-11-10 07:14:42,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:42,975 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-10 07:14:42,982 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-10 07:14:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:14:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:14:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:14:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:14:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:14:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:14:43,108 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:14:43,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:14:49,013 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 07:14:49,013 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:14:49,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:14:49,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:14:49,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:49 BoogieIcfgContainer [2024-11-10 07:14:49,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:14:49,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:14:49,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:14:49,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:14:49,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:14:42" (1/3) ... [2024-11-10 07:14:49,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d43faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:49, skipping insertion in model container [2024-11-10 07:14:49,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:42" (2/3) ... [2024-11-10 07:14:49,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d43faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:49, skipping insertion in model container [2024-11-10 07:14:49,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:49" (3/3) ... [2024-11-10 07:14:49,038 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-10 07:14:49,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:14:49,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:14:49,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:14:49,111 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;@26fb6240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:14:49,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:14:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:14:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 07:14:49,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:49,129 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:49,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1882019788, now seen corresponding path program 1 times [2024-11-10 07:14:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:14:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84569180] [2024-11-10 07:14:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:49,146 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-10 07:14:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:14:49,152 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-10 07:14:49,153 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-10 07:14:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:49,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:14:49,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-10 07:14:50,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:14:51,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:14:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84569180] [2024-11-10 07:14:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84569180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:51,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:14:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 07:14:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796756319] [2024-11-10 07:14:51,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:51,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:14:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:14:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:14:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:14:51,315 INFO L87 Difference]: Start difference. First operand has 88 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:56,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:14:58,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:14:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:58,284 INFO L93 Difference]: Finished difference Result 176 states and 295 transitions. [2024-11-10 07:14:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:14:58,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 165 [2024-11-10 07:14:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:58,332 INFO L225 Difference]: With dead ends: 176 [2024-11-10 07:14:58,332 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 07:14:58,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:14:58,338 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 210 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 112 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:58,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 227 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 142 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2024-11-10 07:14:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 07:14:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-10 07:14:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:14:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-11-10 07:14:58,383 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 165 [2024-11-10 07:14:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:58,384 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-11-10 07:14:58,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 07:14:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-11-10 07:14:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 07:14:58,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:58,387 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:58,406 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:14:58,588 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-10 07:14:58,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:58,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 374891219, now seen corresponding path program 1 times [2024-11-10 07:14:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:14:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668925949] [2024-11-10 07:14:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:58,590 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-10 07:14:58,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:14:58,593 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-10 07:14:58,595 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-10 07:14:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:59,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:14:59,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-10 07:15:00,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:15:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-10 07:15:00,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668925949] [2024-11-10 07:15:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668925949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:15:00,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:15:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 07:15:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045273186] [2024-11-10 07:15:00,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:15:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:15:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:15:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:15:00,872 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-10 07:15:05,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:05,668 INFO L93 Difference]: Finished difference Result 179 states and 258 transitions. [2024-11-10 07:15:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:15:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 165 [2024-11-10 07:15:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:05,704 INFO L225 Difference]: With dead ends: 179 [2024-11-10 07:15:05,704 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 07:15:05,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:15:05,706 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:05,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 231 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 07:15:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 07:15:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2024-11-10 07:15:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:15:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-10 07:15:05,726 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 165 [2024-11-10 07:15:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:05,726 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-10 07:15:05,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-10 07:15:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-10 07:15:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 07:15:05,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:05,729 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:15:05,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:15:05,929 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-10 07:15:05,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -119708431, now seen corresponding path program 1 times [2024-11-10 07:15:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315579043] [2024-11-10 07:15:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:05,931 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-10 07:15:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:05,934 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-10 07:15:05,935 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-10 07:15:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:06,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:15:06,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-10 07:15:09,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:15:11,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315579043] [2024-11-10 07:15:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315579043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:15:11,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1467196228] [2024-11-10 07:15:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:11,106 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 07:15:11,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 07:15:11,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 07:15:11,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 07:15:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:12,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:15:12,905 INFO L278 TraceCheckSpWp]: Computing forward predicates...