./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC --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 a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:52:02,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:52:02,830 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:52:02,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:52:02,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:52:02,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:52:02,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:52:02,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:52:02,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:52:02,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:52:02,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:52:02,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:52:02,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:52:02,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:52:02,882 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:52:02,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:52:02,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:52:02,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:52:02,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:52:02,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:52:02,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:52:02,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:52:02,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:52:02,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:52:02,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:52:02,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC 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 -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2024-11-23 23:52:03,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:52:03,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:52:03,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:52:03,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:52:03,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:52:03,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2024-11-23 23:52:06,093 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/data/c16159f8c/89c16bc1bf8d4c309b8b59ac06529c8f/FLAG2d8b576e0 [2024-11-23 23:52:06,386 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:52:06,390 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2024-11-23 23:52:06,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/data/c16159f8c/89c16bc1bf8d4c309b8b59ac06529c8f/FLAG2d8b576e0 [2024-11-23 23:52:06,459 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/data/c16159f8c/89c16bc1bf8d4c309b8b59ac06529c8f [2024-11-23 23:52:06,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:52:06,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:52:06,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:52:06,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:52:06,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:52:06,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268a6be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06, skipping insertion in model container [2024-11-23 23:52:06,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:52:06,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2024-11-23 23:52:06,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:52:06,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:52:06,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2024-11-23 23:52:06,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:52:06,743 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:52:06,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06 WrapperNode [2024-11-23 23:52:06,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:52:06,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:52:06,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:52:06,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:52:06,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,781 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-23 23:52:06,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:52:06,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:52:06,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:52:06,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:52:06,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,820 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-23 23:52:06,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:52:06,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:52:06,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:52:06,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:52:06,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (1/1) ... [2024-11-23 23:52:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:52:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:06,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:06,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:52:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:52:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:52:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:52:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:52:06,968 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:52:06,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:52:07,104 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-23 23:52:07,104 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:52:07,114 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:52:07,114 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 23:52:07,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:07 BoogieIcfgContainer [2024-11-23 23:52:07,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:52:07,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:52:07,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:52:07,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:52:07,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:52:06" (1/3) ... [2024-11-23 23:52:07,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6ca198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:52:07, skipping insertion in model container [2024-11-23 23:52:07,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:06" (2/3) ... [2024-11-23 23:52:07,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6ca198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:52:07, skipping insertion in model container [2024-11-23 23:52:07,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:07" (3/3) ... [2024-11-23 23:52:07,126 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2024-11-23 23:52:07,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:52:07,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_delay_notd2.c that has 1 procedures, 21 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-23 23:52:07,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:52:07,218 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;@416a93f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:52:07,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:52:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:52:07,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:07,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:07,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:07,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 423488933, now seen corresponding path program 1 times [2024-11-23 23:52:07,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988817060] [2024-11-23 23:52:07,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988817060] [2024-11-23 23:52:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988817060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:07,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:52:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552796509] [2024-11-23 23:52:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:52:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:52:07,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:52:07,462 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:07,478 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2024-11-23 23:52:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:52:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:52:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:07,488 INFO L225 Difference]: With dead ends: 35 [2024-11-23 23:52:07,488 INFO L226 Difference]: Without dead ends: 17 [2024-11-23 23:52:07,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-23 23:52:07,497 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:07,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:52:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-23 23:52:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-23 23:52:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-23 23:52:07,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2024-11-23 23:52:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-23 23:52:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2024-11-23 23:52:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 23:52:07,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:07,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:52:07,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash -254640295, now seen corresponding path program 1 times [2024-11-23 23:52:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176510099] [2024-11-23 23:52:07,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176510099] [2024-11-23 23:52:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176510099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:52:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089459968] [2024-11-23 23:52:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:07,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:52:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:07,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:52:07,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:52:07,760 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:07,828 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2024-11-23 23:52:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:52:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-23 23:52:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:07,830 INFO L225 Difference]: With dead ends: 33 [2024-11-23 23:52:07,830 INFO L226 Difference]: Without dead ends: 20 [2024-11-23 23:52:07,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 23:52:07,831 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:07,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-23 23:52:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-23 23:52:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-23 23:52:07,837 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2024-11-23 23:52:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-23 23:52:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-11-23 23:52:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:52:07,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:07,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:52:07,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -908763655, now seen corresponding path program 1 times [2024-11-23 23:52:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218964891] [2024-11-23 23:52:07,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:52:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218964891] [2024-11-23 23:52:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218964891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:52:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120185664] [2024-11-23 23:52:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:52:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:07,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:52:07,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:52:07,989 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:08,051 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2024-11-23 23:52:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:52:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:52:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:08,054 INFO L225 Difference]: With dead ends: 38 [2024-11-23 23:52:08,054 INFO L226 Difference]: Without dead ends: 24 [2024-11-23 23:52:08,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:52:08,055 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:08,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-23 23:52:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-23 23:52:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-23 23:52:08,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 15 [2024-11-23 23:52:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-23 23:52:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-23 23:52:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:52:08,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:08,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:08,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:52:08,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1588822025, now seen corresponding path program 1 times [2024-11-23 23:52:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144136728] [2024-11-23 23:52:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:52:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:08,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144136728] [2024-11-23 23:52:08,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144136728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:08,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:08,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:52:08,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470933542] [2024-11-23 23:52:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:08,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:52:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:08,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:52:08,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:52:08,134 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:08,171 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2024-11-23 23:52:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:52:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:52:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:08,172 INFO L225 Difference]: With dead ends: 46 [2024-11-23 23:52:08,173 INFO L226 Difference]: Without dead ends: 27 [2024-11-23 23:52:08,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:52:08,174 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:08,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:52:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-23 23:52:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-23 23:52:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-23 23:52:08,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 15 [2024-11-23 23:52:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:08,186 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-23 23:52:08,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-23 23:52:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:52:08,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:08,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:52:08,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1531563723, now seen corresponding path program 1 times [2024-11-23 23:52:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119699457] [2024-11-23 23:52:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:52:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119699457] [2024-11-23 23:52:08,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119699457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:08,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:08,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:52:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125166509] [2024-11-23 23:52:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:08,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:52:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:08,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:52:08,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:52:08,338 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:08,385 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2024-11-23 23:52:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:52:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:52:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:08,386 INFO L225 Difference]: With dead ends: 61 [2024-11-23 23:52:08,386 INFO L226 Difference]: Without dead ends: 42 [2024-11-23 23:52:08,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 23:52:08,391 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:08,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:52:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-23 23:52:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-23 23:52:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-23 23:52:08,407 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 15 [2024-11-23 23:52:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:08,407 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-23 23:52:08,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-23 23:52:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:52:08,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:08,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:08,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:52:08,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:08,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1531504141, now seen corresponding path program 1 times [2024-11-23 23:52:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529783147] [2024-11-23 23:52:08,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529783147] [2024-11-23 23:52:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529783147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990792745] [2024-11-23 23:52:08,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:08,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:08,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:52:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:08,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:52:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:08,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990792745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:08,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-23 23:52:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541946520] [2024-11-23 23:52:08,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:08,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:52:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:52:08,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:52:08,757 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:08,861 INFO L93 Difference]: Finished difference Result 110 states and 164 transitions. [2024-11-23 23:52:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:52:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:52:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:08,866 INFO L225 Difference]: With dead ends: 110 [2024-11-23 23:52:08,868 INFO L226 Difference]: Without dead ends: 74 [2024-11-23 23:52:08,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:52:08,869 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:08,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-23 23:52:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-23 23:52:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-23 23:52:08,892 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 15 [2024-11-23 23:52:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:08,892 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-23 23:52:08,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-23 23:52:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-23 23:52:08,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:08,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:08,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:52:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:09,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1202664275, now seen corresponding path program 1 times [2024-11-23 23:52:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081637902] [2024-11-23 23:52:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-23 23:52:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081637902] [2024-11-23 23:52:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081637902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:52:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443515848] [2024-11-23 23:52:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:09,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:52:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:52:09,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:52:09,195 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:09,276 INFO L93 Difference]: Finished difference Result 158 states and 213 transitions. [2024-11-23 23:52:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:52:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-23 23:52:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:09,277 INFO L225 Difference]: With dead ends: 158 [2024-11-23 23:52:09,277 INFO L226 Difference]: Without dead ends: 88 [2024-11-23 23:52:09,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 23:52:09,278 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:09,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-23 23:52:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2024-11-23 23:52:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2024-11-23 23:52:09,291 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 24 [2024-11-23 23:52:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:09,292 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-11-23 23:52:09,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2024-11-23 23:52:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-23 23:52:09,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:09,292 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:09,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:52:09,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:09,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1715392058, now seen corresponding path program 1 times [2024-11-23 23:52:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:09,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705142620] [2024-11-23 23:52:09,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705142620] [2024-11-23 23:52:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705142620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555740706] [2024-11-23 23:52:09,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:09,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:09,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:52:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:09,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 23:52:09,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:09,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555740706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:09,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-23 23:52:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011240493] [2024-11-23 23:52:09,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:09,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:52:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:52:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:52:09,846 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:10,059 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2024-11-23 23:52:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:52:10,060 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-23 23:52:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:10,061 INFO L225 Difference]: With dead ends: 212 [2024-11-23 23:52:10,061 INFO L226 Difference]: Without dead ends: 144 [2024-11-23 23:52:10,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:52:10,063 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:10,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 18 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-23 23:52:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-23 23:52:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 143 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2024-11-23 23:52:10,094 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 25 [2024-11-23 23:52:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2024-11-23 23:52:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2024-11-23 23:52:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-23 23:52:10,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:10,096 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:10,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:10,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:10,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2036810298, now seen corresponding path program 2 times [2024-11-23 23:52:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850270852] [2024-11-23 23:52:10,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:52:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:10,316 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:52:10,316 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 23:52:10,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850270852] [2024-11-23 23:52:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850270852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:10,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:10,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:52:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557135525] [2024-11-23 23:52:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:10,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:52:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:10,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:52:10,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:52:10,380 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:10,454 INFO L93 Difference]: Finished difference Result 288 states and 347 transitions. [2024-11-23 23:52:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:52:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-23 23:52:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:10,456 INFO L225 Difference]: With dead ends: 288 [2024-11-23 23:52:10,456 INFO L226 Difference]: Without dead ends: 217 [2024-11-23 23:52:10,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:52:10,458 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:10,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 43 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:52:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-23 23:52:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-11-23 23:52:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.2169811320754718) internal successors, (258), 212 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 258 transitions. [2024-11-23 23:52:10,493 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 258 transitions. Word has length 43 [2024-11-23 23:52:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:10,493 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 258 transitions. [2024-11-23 23:52:10,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 258 transitions. [2024-11-23 23:52:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-23 23:52:10,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:10,495 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:10,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:52:10,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2036750716, now seen corresponding path program 1 times [2024-11-23 23:52:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724742729] [2024-11-23 23:52:10,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724742729] [2024-11-23 23:52:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724742729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897247639] [2024-11-23 23:52:10,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:10,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:10,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:52:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 23:52:10,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:11,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897247639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:11,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-11-23 23:52:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685626985] [2024-11-23 23:52:11,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-23 23:52:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:11,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-23 23:52:11,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=678, Unknown=0, NotChecked=0, Total=1190 [2024-11-23 23:52:11,664 INFO L87 Difference]: Start difference. First operand 213 states and 258 transitions. Second operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:12,177 INFO L93 Difference]: Finished difference Result 602 states and 782 transitions. [2024-11-23 23:52:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-23 23:52:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-23 23:52:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:12,180 INFO L225 Difference]: With dead ends: 602 [2024-11-23 23:52:12,180 INFO L226 Difference]: Without dead ends: 393 [2024-11-23 23:52:12,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-23 23:52:12,183 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:12,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 42 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:52:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-23 23:52:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-23 23:52:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.1938775510204083) internal successors, (468), 392 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 468 transitions. [2024-11-23 23:52:12,255 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 468 transitions. Word has length 43 [2024-11-23 23:52:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:12,256 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 468 transitions. [2024-11-23 23:52:12,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 468 transitions. [2024-11-23 23:52:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-23 23:52:12,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:12,260 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:12,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-23 23:52:12,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash 827996804, now seen corresponding path program 2 times [2024-11-23 23:52:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018831170] [2024-11-23 23:52:12,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:52:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:12,499 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:52:12,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018831170] [2024-11-23 23:52:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018831170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103243811] [2024-11-23 23:52:13,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:52:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:13,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:13,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:52:13,689 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:52:13,689 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-23 23:52:13,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:15,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103243811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:16,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 26] total 73 [2024-11-23 23:52:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066685422] [2024-11-23 23:52:16,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-23 23:52:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-23 23:52:16,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1577, Invalid=3825, Unknown=0, NotChecked=0, Total=5402 [2024-11-23 23:52:16,825 INFO L87 Difference]: Start difference. First operand 393 states and 468 transitions. Second operand has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:19,286 INFO L93 Difference]: Finished difference Result 665 states and 794 transitions. [2024-11-23 23:52:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-23 23:52:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-23 23:52:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:19,289 INFO L225 Difference]: With dead ends: 665 [2024-11-23 23:52:19,289 INFO L226 Difference]: Without dead ends: 663 [2024-11-23 23:52:19,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5532 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3710, Invalid=10810, Unknown=0, NotChecked=0, Total=14520 [2024-11-23 23:52:19,296 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 533 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:19,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 67 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:52:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-23 23:52:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 522. [2024-11-23 23:52:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.1900191938579654) internal successors, (620), 521 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 620 transitions. [2024-11-23 23:52:19,337 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 620 transitions. Word has length 73 [2024-11-23 23:52:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 620 transitions. [2024-11-23 23:52:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 620 transitions. [2024-11-23 23:52:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-23 23:52:19,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:19,339 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:19,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-23 23:52:19,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 836124294, now seen corresponding path program 1 times [2024-11-23 23:52:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857185252] [2024-11-23 23:52:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-23 23:52:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857185252] [2024-11-23 23:52:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857185252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154381159] [2024-11-23 23:52:19,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:19,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:19,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:52:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:19,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:52:19,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-23 23:52:20,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-23 23:52:20,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154381159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:20,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:20,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-23 23:52:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224638586] [2024-11-23 23:52:20,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:20,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:52:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:20,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:52:20,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:52:20,654 INFO L87 Difference]: Start difference. First operand 522 states and 620 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:20,840 INFO L93 Difference]: Finished difference Result 1169 states and 1392 transitions. [2024-11-23 23:52:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:52:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-11-23 23:52:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:20,846 INFO L225 Difference]: With dead ends: 1169 [2024-11-23 23:52:20,846 INFO L226 Difference]: Without dead ends: 1038 [2024-11-23 23:52:20,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:52:20,848 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:20,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 92 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:52:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-23 23:52:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-23 23:52:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.188042430086789) internal successors, (1232), 1037 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1232 transitions. [2024-11-23 23:52:20,937 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1232 transitions. Word has length 142 [2024-11-23 23:52:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1232 transitions. [2024-11-23 23:52:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1232 transitions. [2024-11-23 23:52:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-23 23:52:20,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:20,943 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:20,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 23:52:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-23 23:52:21,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 862604934, now seen corresponding path program 2 times [2024-11-23 23:52:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442636844] [2024-11-23 23:52:21,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:52:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:21,237 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:52:21,237 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-23 23:52:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442636844] [2024-11-23 23:52:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442636844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506879170] [2024-11-23 23:52:21,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:52:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:21,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:21,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:52:22,080 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:52:22,080 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:22,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 23:52:22,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-23 23:52:23,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-23 23:52:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506879170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:24,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-23 23:52:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52408489] [2024-11-23 23:52:24,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-23 23:52:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-23 23:52:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2024-11-23 23:52:24,054 INFO L87 Difference]: Start difference. First operand 1038 states and 1232 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:24,457 INFO L93 Difference]: Finished difference Result 2201 states and 2620 transitions. [2024-11-23 23:52:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:52:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 418 [2024-11-23 23:52:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:24,466 INFO L225 Difference]: With dead ends: 2201 [2024-11-23 23:52:24,466 INFO L226 Difference]: Without dead ends: 2070 [2024-11-23 23:52:24,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2024-11-23 23:52:24,468 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 398 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:24,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 188 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:52:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2024-11-23 23:52:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2024-11-23 23:52:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2069 states have (on average 1.1870468825519576) internal successors, (2456), 2069 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2456 transitions. [2024-11-23 23:52:24,619 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2456 transitions. Word has length 418 [2024-11-23 23:52:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:24,620 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 2456 transitions. [2024-11-23 23:52:24,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2456 transitions. [2024-11-23 23:52:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2024-11-23 23:52:24,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:24,648 INFO L218 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:24,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:52:24,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-23 23:52:24,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 748318342, now seen corresponding path program 3 times [2024-11-23 23:52:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:24,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126607316] [2024-11-23 23:52:24,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:52:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:25,537 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-23 23:52:25,537 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-23 23:52:27,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126607316] [2024-11-23 23:52:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126607316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641677719] [2024-11-23 23:52:27,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:52:27,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:27,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:27,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:52:28,953 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-23 23:52:28,953 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:52:28,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-23 23:52:28,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-23 23:52:32,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-23 23:52:33,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641677719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:33,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-11-23 23:52:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486438934] [2024-11-23 23:52:33,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-23 23:52:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:33,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-23 23:52:33,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2024-11-23 23:52:33,535 INFO L87 Difference]: Start difference. First operand 2070 states and 2456 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:34,068 INFO L93 Difference]: Finished difference Result 2975 states and 3536 transitions. [2024-11-23 23:52:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-23 23:52:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 970 [2024-11-23 23:52:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:34,083 INFO L225 Difference]: With dead ends: 2975 [2024-11-23 23:52:34,083 INFO L226 Difference]: Without dead ends: 2844 [2024-11-23 23:52:34,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-23 23:52:34,087 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 489 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:34,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 248 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:52:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-11-23 23:52:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2024-11-23 23:52:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.186774533943018) internal successors, (3374), 2843 states have internal predecessors, (3374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3374 transitions. [2024-11-23 23:52:34,271 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3374 transitions. Word has length 970 [2024-11-23 23:52:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 3374 transitions. [2024-11-23 23:52:34,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3374 transitions. [2024-11-23 23:52:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2024-11-23 23:52:34,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:34,324 INFO L218 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:34,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:52:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-23 23:52:34,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash -729446778, now seen corresponding path program 4 times [2024-11-23 23:52:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357972089] [2024-11-23 23:52:34,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 23:52:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:35,647 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 23:52:35,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 23:52:35,647 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:36,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:52:36,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:52:36,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:52:36,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:52:36,637 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:37,036 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:52:37,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:52:37 BoogieIcfgContainer [2024-11-23 23:52:37,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:52:37,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:52:37,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:52:37,040 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:52:37,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:07" (3/4) ... [2024-11-23 23:52:37,045 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 23:52:37,469 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 963. [2024-11-23 23:52:37,816 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 23:52:37,817 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 23:52:37,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:52:37,819 INFO L158 Benchmark]: Toolchain (without parser) took 31351.30ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 94.7MB in the beginning and 474.1MB in the end (delta: -379.5MB). Peak memory consumption was 343.7MB. Max. memory is 16.1GB. [2024-11-23 23:52:37,819 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:52:37,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.50ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 83.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:52:37,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.62ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:52:37,821 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:52:37,821 INFO L158 Benchmark]: RCFGBuilder took 277.71ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 69.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 23:52:37,821 INFO L158 Benchmark]: TraceAbstraction took 29921.91ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 69.1MB in the beginning and 257.0MB in the end (delta: -187.8MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. [2024-11-23 23:52:37,822 INFO L158 Benchmark]: Witness Printer took 777.45ms. Allocated memory is still 562.0MB. Free memory was 257.0MB in the beginning and 474.1MB in the end (delta: -217.2MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-23 23:52:37,824 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.43ms. Allocated memory is still 167.8MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.50ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 83.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.62ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.71ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 69.8MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29921.91ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 69.1MB in the beginning and 257.0MB in the end (delta: -187.8MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. * Witness Printer took 777.45ms. Allocated memory is still 562.0MB. Free memory was 257.0MB in the beginning and 474.1MB in the end (delta: -217.2MB). Peak memory consumption was 68.0MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [SIZE=20, last=0] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [SIZE=20, last=21] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [SIZE=20, a=0, b=0, d=0, last=21] [L24] st=1 [L25] c=0 VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=20, d=0, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L24] st=1 [L25] c=0 VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=40, b=40, c=20, d=20, last=21] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [SIZE=20, a=0, b=1, c=20, d=20, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [SIZE=20, last=21] [L12] reach_error() VAL [SIZE=20, last=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 15, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2084 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2084 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 665 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 234 mSDtfsCounter, 1171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3543 GetRequests, 3238 SyntacticMatches, 14 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7855 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2844occurred in iteration=14, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 170 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 4892 NumberOfCodeBlocks, 4862 NumberOfCodeBlocksAsserted, 289 NumberOfCheckSat, 5166 ConstructedInterpolants, 0 QuantifiedInterpolants, 30069 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2821 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 39224/442256 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 23:52:37,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fbfcd0-39e6-4fb3-93ff-d079ef69be41/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE