./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:42:05,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:42:05,565 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:42:05,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:42:05,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:42:05,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:42:05,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:42:05,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:42:05,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:42:05,595 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:42:05,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:42:05,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:42:05,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:42:05,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:42:05,598 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:42:05,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:42:05,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:42:05,600 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:42:05,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:42:05,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:42:05,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:42:05,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:42:05,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:42:05,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:42:05,605 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:42:05,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:42:05,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:42:05,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:42:05,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:42:05,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:42:05,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:42:05,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:42:05,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:42:05,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:42:05,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:42:05,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:42:05,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:42:05,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:42:05,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:42:05,610 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:42:05,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:42:05,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:42:05,610 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2023-11-29 05:42:05,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:42:05,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:42:05,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:42:05,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:42:05,856 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:42:05,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-11-29 05:42:08,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:42:08,942 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:42:08,943 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-11-29 05:42:08,958 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/data/094baad6e/44259a4b9c564db48fb5459a11d974f6/FLAG1fea5ea62 [2023-11-29 05:42:08,972 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/data/094baad6e/44259a4b9c564db48fb5459a11d974f6 [2023-11-29 05:42:08,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:42:08,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:42:08,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:42:08,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:42:08,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:42:08,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:42:08" (1/1) ... [2023-11-29 05:42:08,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20be25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:08, skipping insertion in model container [2023-11-29 05:42:08,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:42:08" (1/1) ... [2023-11-29 05:42:09,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:42:09,315 WARN L240 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_387daf63-fe15-45e2-b337-4ee5d469d598/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-11-29 05:42:09,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:42:09,328 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:42:09,365 WARN L240 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_387daf63-fe15-45e2-b337-4ee5d469d598/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-11-29 05:42:09,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:42:09,399 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:42:09,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09 WrapperNode [2023-11-29 05:42:09,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:42:09,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:42:09,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:42:09,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:42:09,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,445 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2023-11-29 05:42:09,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:42:09,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:42:09,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:42:09,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:42:09,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,479 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2023-11-29 05:42:09,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:42:09,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:42:09,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:42:09,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:42:09,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (1/1) ... [2023-11-29 05:42:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:42:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:09,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:42:09,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:42:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:42:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:42:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:42:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:42:09,566 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:42:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:42:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:42:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:42:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:42:09,687 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:42:09,688 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:42:09,845 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:42:09,886 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:42:09,886 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 05:42:09,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:09 BoogieIcfgContainer [2023-11-29 05:42:09,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:42:09,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:42:09,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:42:09,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:42:09,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:42:08" (1/3) ... [2023-11-29 05:42:09,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc9e6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:42:09, skipping insertion in model container [2023-11-29 05:42:09,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:09" (2/3) ... [2023-11-29 05:42:09,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc9e6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:42:09, skipping insertion in model container [2023-11-29 05:42:09,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:09" (3/3) ... [2023-11-29 05:42:09,896 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2023-11-29 05:42:09,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:42:09,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:42:09,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:42:09,957 INFO L357 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, mHoare=true, 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;@40db31d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:42:09,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:42:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:42:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:42:09,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:09,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:09,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:09,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1027000244, now seen corresponding path program 1 times [2023-11-29 05:42:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232701943] [2023-11-29 05:42:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:42:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:42:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232701943] [2023-11-29 05:42:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232701943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:10,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:42:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003253836] [2023-11-29 05:42:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:10,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:42:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:42:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:42:10,263 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:42:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:10,333 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2023-11-29 05:42:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:42:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 05:42:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:10,346 INFO L225 Difference]: With dead ends: 38 [2023-11-29 05:42:10,346 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 05:42:10,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:42:10,354 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:10,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 05:42:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 05:42:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:42:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-11-29 05:42:10,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2023-11-29 05:42:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:10,397 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-11-29 05:42:10,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:42:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-11-29 05:42:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:42:10,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:10,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:10,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:42:10,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:10,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1693233236, now seen corresponding path program 1 times [2023-11-29 05:42:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485404462] [2023-11-29 05:42:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:42:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:42:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485404462] [2023-11-29 05:42:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485404462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:10,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:10,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:42:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105404930] [2023-11-29 05:42:10,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:10,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:42:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:42:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:42:10,610 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:42:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:10,665 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-11-29 05:42:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:42:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 05:42:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:10,667 INFO L225 Difference]: With dead ends: 31 [2023-11-29 05:42:10,667 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 05:42:10,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:42:10,670 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:10,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 05:42:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-11-29 05:42:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:42:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 05:42:10,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-11-29 05:42:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 05:42:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:42:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 05:42:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 05:42:10,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:10,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:10,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:42:10,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:10,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 387079308, now seen corresponding path program 1 times [2023-11-29 05:42:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:10,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375446058] [2023-11-29 05:42:10,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:42:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375446058] [2023-11-29 05:42:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375446058] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738963999] [2023-11-29 05:42:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:10,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:10,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:10,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:42:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:11,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:42:11,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:42:11,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738963999] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:42:11,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:42:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 05:42:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019925646] [2023-11-29 05:42:11,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:11,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:42:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:42:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:42:11,186 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:42:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:11,248 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-29 05:42:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:42:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2023-11-29 05:42:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:11,249 INFO L225 Difference]: With dead ends: 32 [2023-11-29 05:42:11,250 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 05:42:11,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:42:11,252 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:11,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 05:42:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 05:42:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-29 05:42:11,258 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2023-11-29 05:42:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:11,259 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-29 05:42:11,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:42:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-29 05:42:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 05:42:11,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:11,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:11,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:42:11,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:11,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:11,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1812742508, now seen corresponding path program 2 times [2023-11-29 05:42:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739079995] [2023-11-29 05:42:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:42:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739079995] [2023-11-29 05:42:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739079995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:12,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:42:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824884318] [2023-11-29 05:42:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:12,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:42:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:42:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:42:12,240 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:42:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:12,331 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-11-29 05:42:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:42:12,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-29 05:42:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:12,333 INFO L225 Difference]: With dead ends: 22 [2023-11-29 05:42:12,333 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 05:42:12,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:42:12,334 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:12,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 05:42:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 05:42:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 05:42:12,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2023-11-29 05:42:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:12,340 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 05:42:12,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:42:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-29 05:42:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:42:12,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:12,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:12,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:42:12,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:12,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1711139651, now seen corresponding path program 1 times [2023-11-29 05:42:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963915580] [2023-11-29 05:42:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:13,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:42:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963915580] [2023-11-29 05:42:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963915580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198447043] [2023-11-29 05:42:13,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:13,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:13,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:13,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:42:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:13,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 05:42:13,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:13,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 05:42:13,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-11-29 05:42:13,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-29 05:42:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:13,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:13,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2023-11-29 05:42:13,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-29 05:42:13,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-29 05:42:13,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 05:42:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:42:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198447043] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:42:13,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:42:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 18 [2023-11-29 05:42:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770879910] [2023-11-29 05:42:13,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:13,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:42:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:42:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:42:13,689 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:42:17,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:21,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:25,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:29,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:33,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:37,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:38,029 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-11-29 05:42:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:42:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 24 [2023-11-29 05:42:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:38,031 INFO L225 Difference]: With dead ends: 30 [2023-11-29 05:42:38,031 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 05:42:38,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:42:38,032 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:38,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2023-11-29 05:42:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 05:42:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-11-29 05:42:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-29 05:42:38,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 24 [2023-11-29 05:42:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:38,039 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-29 05:42:38,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:42:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-29 05:42:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:42:38,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:38,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:38,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:42:38,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:38,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:38,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1711137977, now seen corresponding path program 1 times [2023-11-29 05:42:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:38,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375098911] [2023-11-29 05:42:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:42:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375098911] [2023-11-29 05:42:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375098911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210313612] [2023-11-29 05:42:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:39,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:39,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:42:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 05:42:39,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:42:39,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:42:39,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:42:40,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:42:40,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:42:40,186 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:42:40,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:42:40,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:42:40,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 05:42:40,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 05:42:40,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 05:42:40,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 05:42:40,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:42:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:42:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:40,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:40,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2023-11-29 05:42:40,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2023-11-29 05:42:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210313612] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:41,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:42:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-11-29 05:42:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584747981] [2023-11-29 05:42:41,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:41,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:42:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:42:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=776, Unknown=23, NotChecked=0, Total=870 [2023-11-29 05:42:41,658 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:42:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:42,440 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-11-29 05:42:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:42:42,441 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-29 05:42:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:42,441 INFO L225 Difference]: With dead ends: 27 [2023-11-29 05:42:42,441 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 05:42:42,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=1406, Unknown=28, NotChecked=0, Total=1560 [2023-11-29 05:42:42,443 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:42,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:42:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 05:42:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 05:42:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-29 05:42:42,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 24 [2023-11-29 05:42:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:42,449 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-29 05:42:42,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:42:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-29 05:42:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:42:42,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:42,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:42,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:42:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 05:42:42,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:42,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 568910808, now seen corresponding path program 1 times [2023-11-29 05:42:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040880560] [2023-11-29 05:42:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:43,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040880560] [2023-11-29 05:42:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040880560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795786084] [2023-11-29 05:42:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:43,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:43,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:42:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:43,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 05:42:43,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:43,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:42:44,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:42:44,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-11-29 05:42:44,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:42:44,283 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:42:44,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-29 05:42:44,309 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:42:44,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:42:44,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:42:44,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 05:42:44,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-11-29 05:42:44,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:42:44,515 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 05:42:44,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2023-11-29 05:42:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:44,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:44,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 206 [2023-11-29 05:42:44,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:44,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2023-11-29 05:42:45,089 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 05:42:45,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-29 05:42:45,106 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-29 05:42:45,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2023-11-29 05:42:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795786084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:45,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:42:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2023-11-29 05:42:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944244643] [2023-11-29 05:42:45,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 05:42:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 05:42:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 05:42:45,591 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:42:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:46,434 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-11-29 05:42:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:42:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 05:42:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:46,436 INFO L225 Difference]: With dead ends: 33 [2023-11-29 05:42:46,436 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:42:46,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=1992, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 05:42:46,439 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:46,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:42:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:42:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-11-29 05:42:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-29 05:42:46,445 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 26 [2023-11-29 05:42:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:46,445 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-29 05:42:46,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:42:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-29 05:42:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:42:46,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:46,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:46,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:42:46,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:46,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:46,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 568912482, now seen corresponding path program 1 times [2023-11-29 05:42:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553387615] [2023-11-29 05:42:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:46,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553387615] [2023-11-29 05:42:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553387615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118028788] [2023-11-29 05:42:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:48,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:48,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:48,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:42:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:48,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-29 05:42:48,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:48,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:42:48,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:42:49,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:42:49,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 05:42:49,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 05:42:49,292 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:42:49,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:42:49,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:42:49,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-29 05:42:49,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:42:49,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:42:49,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 05:42:49,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:42:49,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:42:49,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:42:49,952 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:42:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 05:42:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:42:49,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2023-11-29 05:42:50,000 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:42:50,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:42:50,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 05:42:50,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2023-11-29 05:42:50,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-11-29 05:42:50,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 48 [2023-11-29 05:42:50,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 05:42:50,469 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 05:42:50,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 33 [2023-11-29 05:42:50,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-11-29 05:42:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:42:50,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:52,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:52,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 641 treesize of output 607 [2023-11-29 05:42:52,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:52,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 560 treesize of output 526 [2023-11-29 05:42:52,506 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 05:42:52,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-29 05:42:52,550 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 05:42:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-29 05:42:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118028788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:53,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:42:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2023-11-29 05:42:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202486779] [2023-11-29 05:42:53,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:53,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 05:42:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 05:42:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1762, Unknown=17, NotChecked=0, Total=1892 [2023-11-29 05:42:53,074 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:42:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:54,972 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-29 05:42:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:42:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 05:42:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:54,973 INFO L225 Difference]: With dead ends: 31 [2023-11-29 05:42:54,973 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:42:54,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=223, Invalid=3065, Unknown=18, NotChecked=0, Total=3306 [2023-11-29 05:42:54,976 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:54,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 208 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:42:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:42:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-29 05:42:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-29 05:42:54,984 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 26 [2023-11-29 05:42:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:54,985 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-29 05:42:54,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:42:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-29 05:42:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:42:54,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:54,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:54,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:42:55,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:55,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:55,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1264080947, now seen corresponding path program 2 times [2023-11-29 05:42:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626840635] [2023-11-29 05:42:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:42:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626840635] [2023-11-29 05:42:55,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626840635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077414779] [2023-11-29 05:42:55,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:42:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:55,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:55,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:42:55,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:42:55,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:42:55,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:42:55,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:42:55,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:42:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077414779] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:42:55,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:42:55,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2023-11-29 05:42:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573673116] [2023-11-29 05:42:55,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:42:55,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:42:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:42:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:42:55,708 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:42:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:55,820 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-11-29 05:42:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:42:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-29 05:42:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:55,822 INFO L225 Difference]: With dead ends: 34 [2023-11-29 05:42:55,822 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 05:42:55,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:42:55,823 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:55,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 05:42:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-11-29 05:42:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:42:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-29 05:42:55,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 28 [2023-11-29 05:42:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:55,833 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-29 05:42:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:42:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-11-29 05:42:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:42:55,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:55,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:55,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:42:56,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:56,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:56,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1264082621, now seen corresponding path program 2 times [2023-11-29 05:42:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246322713] [2023-11-29 05:42:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:42:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:42:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:42:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246322713] [2023-11-29 05:42:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246322713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294088517] [2023-11-29 05:42:58,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:42:58,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:58,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:58,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:42:58,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:42:58,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:42:58,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-29 05:42:58,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:58,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:42:58,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:42:58,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:42:59,106 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:42:59,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:42:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:42:59,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:42:59,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-11-29 05:42:59,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 05:42:59,391 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-29 05:42:59,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2023-11-29 05:42:59,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-11-29 05:42:59,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:42:59,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:42:59,522 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 05:42:59,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2023-11-29 05:42:59,548 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2023-11-29 05:42:59,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2023-11-29 05:42:59,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:42:59,584 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 05:42:59,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-11-29 05:42:59,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2023-11-29 05:42:59,724 INFO L349 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2023-11-29 05:42:59,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 67 [2023-11-29 05:42:59,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 93 [2023-11-29 05:42:59,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 101 [2023-11-29 05:43:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:43:00,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:02,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:43:02,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 451 treesize of output 435 [2023-11-29 05:43:02,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:43:02,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 388 treesize of output 372 [2023-11-29 05:43:02,967 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 05:43:02,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-29 05:43:03,051 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 05:43:03,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-29 05:43:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294088517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:03,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:43:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2023-11-29 05:43:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772836792] [2023-11-29 05:43:03,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 05:43:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 05:43:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 05:43:03,413 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:43:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:04,777 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-11-29 05:43:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:43:04,777 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.25) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-11-29 05:43:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:04,778 INFO L225 Difference]: With dead ends: 49 [2023-11-29 05:43:04,778 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 05:43:04,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=185, Invalid=3007, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 05:43:04,780 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:04,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 274 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:43:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 05:43:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-29 05:43:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:43:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 05:43:04,786 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2023-11-29 05:43:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:04,786 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 05:43:04,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.25) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:43:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 05:43:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:43:04,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:04,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:04,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:43:04,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 05:43:04,988 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:04,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1463939997, now seen corresponding path program 3 times [2023-11-29 05:43:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:43:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758061871] [2023-11-29 05:43:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:43:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:43:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:43:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:43:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:43:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:43:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758061871] [2023-11-29 05:43:05,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758061871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627104340] [2023-11-29 05:43:05,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:43:05,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:43:05,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:43:05,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:43:05,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:43:05,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:43:05,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:43:05,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:43:05,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:43:05,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627104340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:43:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-11-29 05:43:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756332545] [2023-11-29 05:43:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:05,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:43:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:43:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:43:05,708 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:43:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:05,727 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-11-29 05:43:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:43:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2023-11-29 05:43:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:05,728 INFO L225 Difference]: With dead ends: 34 [2023-11-29 05:43:05,728 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:43:05,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:43:05,729 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:05,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:43:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:43:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:43:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-29 05:43:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:43:05,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-11-29 05:43:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:05,730 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:43:05,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:43:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:43:05,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:43:05,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:43:05,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:43:05,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:43:05,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:43:06,392 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-29 05:43:06,392 INFO L899 garLoopResultBuilder]: For program point L618(lines 618 620) no Hoare annotation was computed. [2023-11-29 05:43:06,392 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 604 631) no Hoare annotation was computed. [2023-11-29 05:43:06,392 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse6 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse8 (not .cse1)) (.cse9 (= (select (select |#memory_int#2| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (= .cse11 0))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse2 .cse3 .cse4 .cse5) (and .cse6 (= (select (select |#memory_$Pointer$#2.base| .cse11) 4) 0) .cse7 .cse8 .cse9 .cse0 (<= |ULTIMATE.start_sll_create_~len#1| 0) (= (select (select |#memory_int#2| .cse11) 0) 1) (= (select |#valid| .cse11) 1) (= (select (select |#memory_$Pointer$#2.offset| .cse11) 4) 0) .cse2 .cse3 .cse4 .cse5 (not .cse10))))) [2023-11-29 05:43:06,392 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 629) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse1) (= (select (select |#memory_int#2| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) .cse0 (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) .cse2 .cse3 .cse4 .cse5))) [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point L611(lines 611 613) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L895 garLoopResultBuilder]: At program point L616-2(lines 616 623) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~ptr~0#1.base| 0))) (let ((.cse4 (not .cse1)) (.cse0 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= (select (select |#memory_int#2| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1))) (or (and (= |ULTIMATE.start_main_~count~0#1| 3) .cse0 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_main_~count~0#1| 1) .cse4 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 4))) (let ((.cse5 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) .cse6))) (let ((.cse7 (select (select |#memory_$Pointer$#2.base| .cse5) 4))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse5) (= (select (select |#memory_$Pointer$#2.offset| .cse5) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) .cse6) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_26| .cse5)) (not (= .cse7 |v_ULTIMATE.start_main_~ptr~0#1.base_26|)) (not (= .cse7 .cse5)) (= (select (select |#memory_int#2| .cse7) 0) 1)))))) .cse0 .cse8 .cse2 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse9 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse9) (not (= (select (select |#memory_$Pointer$#2.base| .cse9) 4) 0)) (not (= .cse9 |v_ULTIMATE.start_main_~ptr~0#1.base_22|))))) .cse3 .cse10 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse12 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 4))) (let ((.cse13 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) .cse12))) (let ((.cse11 (select (select |#memory_$Pointer$#2.base| .cse13) 4))) (and (= (select (select |#memory_$Pointer$#2.offset| .cse11) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) .cse12) 0) (= (select (select |#memory_$Pointer$#2.base| .cse11) 4) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse13) (not (= .cse11 |v_ULTIMATE.start_main_~ptr~0#1.base_34|)) (not (= .cse11 .cse13)) (not (= .cse13 |v_ULTIMATE.start_main_~ptr~0#1.base_34|)))))))) (and .cse4 .cse0 .cse8 .cse2 .cse3 (= 2 |ULTIMATE.start_main_~count~0#1|) .cse10 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 4))) (let ((.cse15 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) .cse17)) (.cse16 (+ (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) .cse17) 4))) (let ((.cse14 (select (select |#memory_$Pointer$#2.base| .cse15) .cse16))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse14) (= (select (select |#memory_$Pointer$#2.offset| .cse14) 4) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_34| .cse14)) (= (select (select |#memory_$Pointer$#2.base| .cse14) 4) 0) (not (= .cse15 .cse14)) (not (= .cse15 |v_ULTIMATE.start_main_~ptr~0#1.base_34|)) (= (select (select |#memory_$Pointer$#2.offset| .cse15) .cse16) 0)))))))))) [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point L616-3(lines 604 631) no Hoare annotation was computed. [2023-11-29 05:43:06,393 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$#2.base| .cse2) 4)) (.cse0 (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_prepend_~head#1.base|) 0)) 4))) (and (= 0 (select (select |#memory_$Pointer$#2.offset| .cse0) 4)) (not (= |ULTIMATE.start_main_~uneq~0#1| 1)) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 0)) (= (select (select |#memory_int#2| .cse2) 0) 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_prepend_~head#1.base|) 0) 0) (= (select |#valid| .cse2) 1) (= (select (select |#memory_int#2| .cse1) 0) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |#valid| .cse1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |#memory_$Pointer$#2.base| .cse0) 4) 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_prepend_~data#1|) (not (= .cse2 0))))) [2023-11-29 05:43:06,393 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-11-29 05:43:06,394 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 604 631) no Hoare annotation was computed. [2023-11-29 05:43:06,394 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-11-29 05:43:06,394 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-29 05:43:06,394 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-29 05:43:06,394 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-11-29 05:43:06,394 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-29 05:43:06,396 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2023-11-29 05:43:06,398 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:43:06,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int, v_ULTIMATE.start_main_~ptr~0#1.offset_25 : int :: (((((~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4] && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == 0) && #memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4] == 0) && !(v_ULTIMATE.start_main_~ptr~0#1.base_26 == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4])) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4])) && #memory_int#2[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4]][0] == 1) could not be translated [2023-11-29 05:43:06,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_21 : int, v_ULTIMATE.start_main_~ptr~0#1.base_22 : int :: (~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4] && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4]][4] == 0)) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_22)) could not be translated [2023-11-29 05:43:06,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~ptr~0!base][0] could not be translated [2023-11-29 05:43:06,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_33 : int, v_ULTIMATE.start_main_~ptr~0#1.base_34 : int :: (((((#memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4]][4] == 0 && #memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == 0) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4] == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4])) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) could not be translated [2023-11-29 05:43:06,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~ptr~0!base][0] could not be translated [2023-11-29 05:43:06,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_33 : int, v_ULTIMATE.start_main_~ptr~0#1.base_34 : int :: (((((~ptr~0!base == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4] && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4]][4] == 0) && !(v_ULTIMATE.start_main_~ptr~0#1.base_34 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4])) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4]][4] == 0) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4])) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4] == 0) could not be translated [2023-11-29 05:43:06,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated [2023-11-29 05:43:06,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 05:43:06,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~head~0!base][0] could not be translated [2023-11-29 05:43:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated [2023-11-29 05:43:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated [2023-11-29 05:43:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated [2023-11-29 05:43:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 05:43:06,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~head~0!base][0] could not be translated [2023-11-29 05:43:06,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#memory_$Pointer$#2.base[~head~0!base][4]][0] could not be translated [2023-11-29 05:43:06,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head~0!base][4]] could not be translated [2023-11-29 05:43:06,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated [2023-11-29 05:43:06,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated [2023-11-29 05:43:06,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:43:06 BoogieIcfgContainer [2023-11-29 05:43:06,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:43:06,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:43:06,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:43:06,419 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:43:06,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:09" (3/4) ... [2023-11-29 05:43:06,422 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:43:06,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-29 05:43:06,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 05:43:06,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 05:43:06,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:43:06,431 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:43:06,521 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:43:06,522 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:43:06,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:43:06,523 INFO L158 Benchmark]: Toolchain (without parser) took 57546.77ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 116.6MB in the beginning and 201.7MB in the end (delta: -85.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,523 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:43:06,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.98ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 98.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.37ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 96.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,525 INFO L158 Benchmark]: Boogie Preprocessor took 53.15ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,525 INFO L158 Benchmark]: RCFGBuilder took 387.09ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 75.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,525 INFO L158 Benchmark]: TraceAbstraction took 56528.42ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 75.4MB in the beginning and 207.0MB in the end (delta: -131.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,526 INFO L158 Benchmark]: Witness Printer took 103.17ms. Allocated memory is still 260.0MB. Free memory was 207.0MB in the beginning and 201.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:43:06,528 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.98ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 98.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.37ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 96.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.15ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.09ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 75.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56528.42ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 75.4MB in the beginning and 207.0MB in the end (delta: -131.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Witness Printer took 103.17ms. Allocated memory is still 260.0MB. Free memory was 207.0MB in the beginning and 201.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int, v_ULTIMATE.start_main_~ptr~0#1.offset_25 : int :: (((((~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4] && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == 0) && #memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4] == 0) && !(v_ULTIMATE.start_main_~ptr~0#1.base_26 == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4])) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4] == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4])) && #memory_int#2[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][v_ULTIMATE.start_main_~ptr~0#1.offset_25 + 4]][4]][0] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_21 : int, v_ULTIMATE.start_main_~ptr~0#1.base_22 : int :: (~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4] && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4]][4] == 0)) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][v_ULTIMATE.start_main_~ptr~0#1.offset_21 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_22)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_33 : int, v_ULTIMATE.start_main_~ptr~0#1.base_34 : int :: (((((#memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4]][4] == 0 && #memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == 0) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) && !(#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][4] == #memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4])) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.offset_33 : int, v_ULTIMATE.start_main_~ptr~0#1.base_34 : int :: (((((~ptr~0!base == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4] && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4]][4] == 0) && !(v_ULTIMATE.start_main_~ptr~0#1.base_34 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4])) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4]][4] == 0) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4])) && !(#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] == v_ULTIMATE.start_main_~ptr~0#1.base_34)) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4]][#memory_$Pointer$#2.offset[v_ULTIMATE.start_main_~ptr~0#1.base_34][v_ULTIMATE.start_main_~ptr~0#1.offset_33 + 4] + 4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[#memory_$Pointer$#2.base[~head~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated * 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 - PositiveResult [Line: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1330 SdHoareTripleChecker+Invalid, 26.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1193 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2254 IncrementalHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 137 mSDtfsCounter, 2254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 253 SyntacticMatches, 4 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 13 PreInvPairs, 23 NumberOfFragments, 844 HoareAnnotationTreeSize, 13 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 500 ConstructedInterpolants, 20 QuantifiedInterpolants, 5765 SizeOfPredicates, 112 NumberOfNonLiveVariables, 2704 ConjunctsInSsa, 518 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 218/324 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((count == 3) && (len == 2)) || (((count == 1) && (data == 1)) && (len == 2))) || (((data == 1) && (len == 2)) && (2 == count))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((2 == len) && (data == 1)) && (len == 2)) && (data == 1)) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 05:43:06,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_387daf63-fe15-45e2-b337-4ee5d469d598/bin/uautomizer-verify-BQ2R08f2Ya/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 Result: TRUE