./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/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_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/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_871eb06a-0407-4550-9946-dbafd8be9c00/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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:36:41,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:36:41,512 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:36:41,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:36:41,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:36:41,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:36:41,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:36:41,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:36:41,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:36:41,544 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:36:41,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:36:41,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:36:41,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:36:41,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:36:41,547 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:36:41,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:36:41,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:36:41,549 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:36:41,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:36:41,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:36:41,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:36:41,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:36:41,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:36:41,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:36:41,553 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:36:41,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:36:41,554 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:36:41,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:36:41,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:36:41,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:36:41,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:36:41,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:36:41,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:36:41,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:36:41,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:36:41,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:36:41,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:36:41,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:36:41,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:36:41,558 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:36:41,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:36:41,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:36:41,558 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_871eb06a-0407-4550-9946-dbafd8be9c00/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_871eb06a-0407-4550-9946-dbafd8be9c00/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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2023-11-29 02:36:41,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:36:41,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:36:41,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:36:41,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:36:41,815 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:36:41,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-29 02:36:44,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:36:44,748 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:36:44,749 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-29 02:36:44,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/data/46517a2e5/7383751438054e93b143034319070ec1/FLAGf996bfaf8 [2023-11-29 02:36:44,781 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/data/46517a2e5/7383751438054e93b143034319070ec1 [2023-11-29 02:36:44,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:36:44,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:36:44,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:36:44,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:36:44,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:36:44,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:36:44" (1/1) ... [2023-11-29 02:36:44,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7d17eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:44, skipping insertion in model container [2023-11-29 02:36:44,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:36:44" (1/1) ... [2023-11-29 02:36:44,843 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:36:45,206 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_871eb06a-0407-4550-9946-dbafd8be9c00/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-29 02:36:45,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:36:45,253 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:36:45,288 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_871eb06a-0407-4550-9946-dbafd8be9c00/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-29 02:36:45,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:36:45,353 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:36:45,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45 WrapperNode [2023-11-29 02:36:45,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:36:45,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:36:45,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:36:45,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:36:45,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,409 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-11-29 02:36:45,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:36:45,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:36:45,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:36:45,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:36:45,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,461 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-11-29 02:36:45,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:36:45,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:36:45,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:36:45,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:36:45,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (1/1) ... [2023-11-29 02:36:45,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:36:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:36:45,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:36:45,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:36:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:36:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:36:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-29 02:36:45,563 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-29 02:36:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:36:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 02:36:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 02:36:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-29 02:36:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-29 02:36:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:36:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:36:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-29 02:36:45,565 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-29 02:36:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:36:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:36:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:36:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:36:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:36:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:36:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-29 02:36:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-29 02:36:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:36:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:36:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:36:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:36:45,715 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:36:45,717 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:36:46,016 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:36:46,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:36:46,068 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-29 02:36:46,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:36:46 BoogieIcfgContainer [2023-11-29 02:36:46,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:36:46,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:36:46,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:36:46,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:36:46,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:36:44" (1/3) ... [2023-11-29 02:36:46,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257cf73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:36:46, skipping insertion in model container [2023-11-29 02:36:46,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:36:45" (2/3) ... [2023-11-29 02:36:46,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257cf73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:36:46, skipping insertion in model container [2023-11-29 02:36:46,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:36:46" (3/3) ... [2023-11-29 02:36:46,076 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-11-29 02:36:46,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:36:46,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:36:46,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:36:46,139 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;@4c947fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:36:46,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:36:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 02:36:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:36:46,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:46,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:46,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:46,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-11-29 02:36:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818995614] [2023-11-29 02:36:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:46,274 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 02:36:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818995614] [2023-11-29 02:36:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818995614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:36:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086750667] [2023-11-29 02:36:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:46,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:36:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:36:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:36:46,309 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:36:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:46,376 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-11-29 02:36:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:36:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 02:36:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:46,387 INFO L225 Difference]: With dead ends: 210 [2023-11-29 02:36:46,388 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 02:36:46,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:36:46,396 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:46,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:36:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 02:36:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 02:36:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:36:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-11-29 02:36:46,441 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-11-29 02:36:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:46,441 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-11-29 02:36:46,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:36:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-11-29 02:36:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 02:36:46,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:46,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:36:46,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:46,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-11-29 02:36:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497392151] [2023-11-29 02:36:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:46,772 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 02:36:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497392151] [2023-11-29 02:36:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497392151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:36:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174710589] [2023-11-29 02:36:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:46,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:36:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:36:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:36:46,776 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:47,114 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-11-29 02:36:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:36:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-29 02:36:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:47,116 INFO L225 Difference]: With dead ends: 101 [2023-11-29 02:36:47,117 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 02:36:47,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:36:47,118 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:47,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:36:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 02:36:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 02:36:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:36:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-29 02:36:47,138 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-11-29 02:36:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:47,139 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-29 02:36:47,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-29 02:36:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 02:36:47,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:47,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:47,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:36:47,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:47,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-11-29 02:36:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:47,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735532814] [2023-11-29 02:36:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:47,757 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 02:36:47,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735532814] [2023-11-29 02:36:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735532814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:36:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381463150] [2023-11-29 02:36:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:47,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:36:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:36:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:36:47,760 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:48,929 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-11-29 02:36:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:36:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 02:36:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:48,933 INFO L225 Difference]: With dead ends: 187 [2023-11-29 02:36:48,933 INFO L226 Difference]: Without dead ends: 181 [2023-11-29 02:36:48,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:36:48,935 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:48,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:36:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-29 02:36:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-11-29 02:36:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 02:36:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-11-29 02:36:48,969 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-11-29 02:36:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:48,969 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-11-29 02:36:48,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-11-29 02:36:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 02:36:48,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:48,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:48,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:36:48,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:48,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-11-29 02:36:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907553613] [2023-11-29 02:36:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:49,907 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 02:36:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907553613] [2023-11-29 02:36:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907553613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:49,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:49,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:36:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393464370] [2023-11-29 02:36:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:49,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:36:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:36:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:36:49,910 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:51,016 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-11-29 02:36:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:36:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-29 02:36:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:51,019 INFO L225 Difference]: With dead ends: 259 [2023-11-29 02:36:51,019 INFO L226 Difference]: Without dead ends: 256 [2023-11-29 02:36:51,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:36:51,021 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:51,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 160 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:36:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-29 02:36:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-11-29 02:36:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:36:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-11-29 02:36:51,077 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-11-29 02:36:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:51,078 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-11-29 02:36:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-11-29 02:36:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:36:51,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:51,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:51,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:36:51,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:51,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-11-29 02:36:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970441960] [2023-11-29 02:36:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:51,897 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 02:36:51,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:51,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970441960] [2023-11-29 02:36:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970441960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:36:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798376410] [2023-11-29 02:36:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:51,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:36:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:36:51,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:36:51,900 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:53,078 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-11-29 02:36:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:36:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-11-29 02:36:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:53,081 INFO L225 Difference]: With dead ends: 258 [2023-11-29 02:36:53,081 INFO L226 Difference]: Without dead ends: 255 [2023-11-29 02:36:53,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:36:53,083 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:53,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 189 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:36:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-29 02:36:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-11-29 02:36:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:36:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-11-29 02:36:53,122 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-11-29 02:36:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:53,123 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-11-29 02:36:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-11-29 02:36:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 02:36:53,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:53,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:36:53,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:53,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-11-29 02:36:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006883175] [2023-11-29 02:36:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:54,115 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 02:36:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006883175] [2023-11-29 02:36:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006883175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:36:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062664221] [2023-11-29 02:36:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:36:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:54,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:36:54,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:36:54,118 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:55,326 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-11-29 02:36:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:36:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-11-29 02:36:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:55,329 INFO L225 Difference]: With dead ends: 257 [2023-11-29 02:36:55,329 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 02:36:55,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:36:55,331 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:55,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 176 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:36:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 02:36:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-11-29 02:36:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:36:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-11-29 02:36:55,365 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-11-29 02:36:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:55,365 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-11-29 02:36:55,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-11-29 02:36:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 02:36:55,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:55,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:55,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:36:55,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:55,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-11-29 02:36:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494613900] [2023-11-29 02:36:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:56,252 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 02:36:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494613900] [2023-11-29 02:36:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494613900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:36:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:36:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:36:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920172979] [2023-11-29 02:36:56,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:36:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:36:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:36:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:36:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:36:56,254 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:36:57,370 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-11-29 02:36:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:36:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-29 02:36:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:36:57,372 INFO L225 Difference]: With dead ends: 256 [2023-11-29 02:36:57,373 INFO L226 Difference]: Without dead ends: 253 [2023-11-29 02:36:57,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:36:57,374 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:36:57,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 173 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:36:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-29 02:36:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-11-29 02:36:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:36:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-11-29 02:36:57,417 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-11-29 02:36:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:36:57,418 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-11-29 02:36:57,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:36:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-11-29 02:36:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 02:36:57,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:36:57,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:36:57,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:36:57,420 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:36:57,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:36:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-11-29 02:36:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:36:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400236713] [2023-11-29 02:36:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:36:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:36:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:36:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:36:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:36:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400236713] [2023-11-29 02:36:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400236713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:36:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24199430] [2023-11-29 02:36:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:36:58,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:36:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:36:58,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:36:58,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:36:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:36:58,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 02:36:58,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:36:59,013 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 02:36:59,014 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 19 treesize of output 16 [2023-11-29 02:36:59,058 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 02:36:59,067 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 02:36:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-29 02:36:59,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:36:59,468 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 36 treesize of output 17 [2023-11-29 02:36:59,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2023-11-29 02:36:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-29 02:36:59,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:36:59,493 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 36 treesize of output 19 [2023-11-29 02:36:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2023-11-29 02:36:59,571 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:36:59,571 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:36:59,576 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 24 treesize of output 11 [2023-11-29 02:36:59,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:36:59,666 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 11 treesize of output 11 [2023-11-29 02:36:59,733 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 02:36:59,745 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 17 treesize of output 12 [2023-11-29 02:36:59,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2023-11-29 02:36:59,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:36:59,890 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-11-29 02:36:59,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-11-29 02:36:59,896 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 14 [2023-11-29 02:36:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-29 02:36:59,966 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 16 [2023-11-29 02:37:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:37:00,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:37:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24199430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:37:00,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:37:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-11-29 02:37:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151366214] [2023-11-29 02:37:00,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:37:00,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:37:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:37:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=751, Unknown=6, NotChecked=0, Total=870 [2023-11-29 02:37:00,490 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:37:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:37:02,755 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2023-11-29 02:37:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:37:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-11-29 02:37:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:37:02,758 INFO L225 Difference]: With dead ends: 258 [2023-11-29 02:37:02,758 INFO L226 Difference]: Without dead ends: 255 [2023-11-29 02:37:02,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=1304, Unknown=11, NotChecked=0, Total=1560 [2023-11-29 02:37:02,760 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 718 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 169 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:37:02,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 154 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1400 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:37:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-29 02:37:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-11-29 02:37:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 219 states have internal predecessors, (252), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:37:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2023-11-29 02:37:02,807 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 33 [2023-11-29 02:37:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:37:02,807 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2023-11-29 02:37:02,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:37:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2023-11-29 02:37:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 02:37:02,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:37:02,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:37:02,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:37:03,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:37:03,010 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:37:03,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:37:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-11-29 02:37:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:37:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355198934] [2023-11-29 02:37:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:37:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:37:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:03,550 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 02:37:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:37:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355198934] [2023-11-29 02:37:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355198934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:37:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:37:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:37:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518132201] [2023-11-29 02:37:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:37:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:37:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:37:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:37:03,552 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:37:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:37:04,490 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2023-11-29 02:37:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:37:04,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-11-29 02:37:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:37:04,492 INFO L225 Difference]: With dead ends: 257 [2023-11-29 02:37:04,492 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 02:37:04,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:37:04,493 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 398 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:37:04,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 163 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:37:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 02:37:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-11-29 02:37:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2303921568627452) internal successors, (251), 219 states have internal predecessors, (251), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:37:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 290 transitions. [2023-11-29 02:37:04,539 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 290 transitions. Word has length 35 [2023-11-29 02:37:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:37:04,539 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 290 transitions. [2023-11-29 02:37:04,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:37:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 290 transitions. [2023-11-29 02:37:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 02:37:04,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:37:04,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:37:04,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:37:04,541 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:37:04,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:37:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-11-29 02:37:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:37:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707563744] [2023-11-29 02:37:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:37:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:37:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:37:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:37:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:37:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707563744] [2023-11-29 02:37:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707563744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:37:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966473436] [2023-11-29 02:37:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:06,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:37:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:37:06,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:37:06,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:37:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:06,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-29 02:37:06,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:37:06,233 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 02:37:06,234 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 19 treesize of output 16 [2023-11-29 02:37:06,279 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 16 [2023-11-29 02:37:06,347 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-11-29 02:37:06,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:06,356 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 0 case distinctions, treesize of input 79 treesize of output 72 [2023-11-29 02:37:06,361 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 0 case distinctions, treesize of input 63 treesize of output 47 [2023-11-29 02:37:06,366 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 7 treesize of output 3 [2023-11-29 02:37:06,387 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:37:06,388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 88 [2023-11-29 02:37:06,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:06,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-11-29 02:37:06,416 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2023-11-29 02:37:06,417 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 33 treesize of output 51 [2023-11-29 02:37:06,452 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 97 [2023-11-29 02:37:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:06,459 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 92 treesize of output 90 [2023-11-29 02:37:06,465 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 0 case distinctions, treesize of input 82 treesize of output 66 [2023-11-29 02:37:06,497 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:37:06,497 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 81 [2023-11-29 02:37:06,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:06,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-11-29 02:37:06,508 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 16 treesize of output 15 [2023-11-29 02:37:06,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:37:06,517 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 17 treesize of output 21 [2023-11-29 02:37:06,534 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2023-11-29 02:37:06,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:06,540 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 0 case distinctions, treesize of input 83 treesize of output 78 [2023-11-29 02:37:06,544 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 63 treesize of output 59 [2023-11-29 02:37:06,552 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 12 treesize of output 1 [2023-11-29 02:37:06,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 159 [2023-11-29 02:37:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:06,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:06,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 57 treesize of output 56 [2023-11-29 02:37:06,899 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-11-29 02:37:06,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 27 treesize of output 34 [2023-11-29 02:37:06,918 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 02:37:06,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-11-29 02:37:07,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:07,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:07,016 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 0 case distinctions, treesize of input 39 treesize of output 18 [2023-11-29 02:37:07,200 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 103 treesize of output 98 [2023-11-29 02:37:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:07,208 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 0 case distinctions, treesize of input 85 treesize of output 72 [2023-11-29 02:37:07,223 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:37:07,223 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2023-11-29 02:37:07,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-11-29 02:37:07,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:37:07,361 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 11 treesize of output 11 [2023-11-29 02:37:07,428 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 32 treesize of output 25 [2023-11-29 02:37:07,432 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 24 treesize of output 19 [2023-11-29 02:37:07,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 172 [2023-11-29 02:37:07,756 INFO L349 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2023-11-29 02:37:07,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 198 [2023-11-29 02:37:07,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:07,803 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2023-11-29 02:37:07,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 118 [2023-11-29 02:37:07,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 78 treesize of output 67 [2023-11-29 02:37:07,842 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 7 treesize of output 3 [2023-11-29 02:37:07,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 31 [2023-11-29 02:37:08,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:08,971 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-11-29 02:37:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1054 treesize of output 1005 [2023-11-29 02:37:09,155 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-11-29 02:37:09,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 336 [2023-11-29 02:37:09,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:09,199 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 17 treesize of output 11 [2023-11-29 02:37:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 215 treesize of output 179 [2023-11-29 02:37:09,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:09,812 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-11-29 02:37:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1034 treesize of output 985 [2023-11-29 02:37:09,971 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 02:37:09,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 296 [2023-11-29 02:37:09,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:09,987 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 17 treesize of output 11 [2023-11-29 02:37:10,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 168 [2023-11-29 02:37:10,480 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (= 3 (select .cse6 4))) (.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 4) 4)) (.cse13 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int) (v_prenex_163 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_19) v_DerPreprocessor_18 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 .cse6))) (let ((.cse1 (select .cse5 v_DerPreprocessor_10)) (.cse0 (+ v_prenex_163 4))) (let ((.cse3 (select (store .cse1 .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse2 (select .cse5 .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse0) 4) (= .cse1 v_DerPreprocessor_19) (= v_DerPreprocessor_20 .cse2) (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) (not (= v_DerPreprocessor_10 3)) (= v_DerPreprocessor_18 .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) .cse7) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse11 (select (select .cse10 3) 0))) (let ((.cse12 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse10 .cse11) (store (select |c_#memory_$Pointer$#1.base| .cse11) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse12 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse11) (= (store .cse12 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse11) (= (select .cse9 .cse11) v_DerPreprocessor_14))))))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse16 (select (select .cse15 3) 0))) (let ((.cse17 (+ 4 v_arrayElimCell_71)) (.cse18 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse14 (store (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse15 .cse16) (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse18 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse16) (= (store .cse18 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse16) (= (select .cse14 .cse16) v_DerPreprocessor_14)))))) .cse8) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse19 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse23 (select .cse21 3))) (let ((.cse22 (select .cse23 0))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse21 .cse22) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_11 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse23 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse22) (= v_DerPreprocessor_10 .cse22) (= (select .cse20 .cse22) v_DerPreprocessor_14))))))))) (= (store .cse19 0 .cse13) .cse6)))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 .cse6)) (.cse25 (+ 4 v_arrayElimCell_71))) (and (= (select .cse24 v_DerPreprocessor_10) (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse25)) (not (= v_DerPreprocessor_10 3)) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)) (not (= .cse25 0))))) .cse7) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse26 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse30 (select .cse28 3))) (let ((.cse29 (select .cse30 0))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse28 .cse29) (store (select |c_#memory_$Pointer$#1.base| .cse29) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse30 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse29) (= v_DerPreprocessor_10 .cse29) (= (select .cse27 .cse29) v_DerPreprocessor_14))))))))) (= (store .cse26 0 .cse13) .cse6)))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse31 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse36 (select .cse33 3))) (let ((.cse34 (select .cse36 0))) (let ((.cse35 (+ 4 v_arrayElimCell_71)) (.cse32 (store (store (store |c_#memory_$Pointer$#1.base| .cse34 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse32 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse33 .cse34) (store (select |c_#memory_$Pointer$#1.base| .cse34) .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse36 4) 3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) .cse35) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse34) (= v_DerPreprocessor_10 .cse34) (= (select .cse32 .cse34) v_DerPreprocessor_14))))))))) (= (store .cse31 0 .cse13) .cse6)))) (and .cse8 (or (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimCell_71 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_28) v_DerPreprocessor_27 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_30) 3 .cse6))) (let ((.cse37 (select .cse41 v_DerPreprocessor_10)) (.cse40 (+ 4 v_arrayElimCell_71))) (let ((.cse39 (select (store .cse37 .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse38 (select .cse41 .cse39))) (and (= v_DerPreprocessor_28 .cse37) (= v_DerPreprocessor_29 .cse38) (= v_DerPreprocessor_27 .cse39) (= .cse38 (select |c_#memory_$Pointer$#1.base| .cse39)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse40)) (not (= v_DerPreprocessor_10 3)) (= (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_165 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_33) 3 .cse6)) (.cse42 (+ v_prenex_165 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse42) 4) (= .cse4 (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10) (select .cse43 v_DerPreprocessor_10)) (not (= .cse42 0)) (not (= v_DerPreprocessor_10 3)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10))))))) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse46 (select (select .cse45 3) 0))) (let ((.cse47 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse44 (store (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse45 .cse46) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_16 (store .cse47 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse46) (= (store .cse47 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse46) (= (select .cse44 .cse46) v_DerPreprocessor_14)))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-11-29 02:37:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:14,963 INFO L349 Elim1Store]: treesize reduction 3857, result has 13.2 percent of original size [2023-11-29 02:37:14,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 1 disjoint index pairs (out of 276 index pairs), introduced 26 new quantified variables, introduced 297 case distinctions, treesize of input 872873 treesize of output 682291 [2023-11-29 02:37:17,315 INFO L349 Elim1Store]: treesize reduction 184, result has 66.7 percent of original size [2023-11-29 02:37:17,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 5397 treesize of output 5730 [2023-11-29 02:37:17,929 INFO L349 Elim1Store]: treesize reduction 55, result has 30.4 percent of original size [2023-11-29 02:37:17,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5388 treesize of output 5379 [2023-11-29 02:37:18,837 INFO L349 Elim1Store]: treesize reduction 47, result has 33.8 percent of original size [2023-11-29 02:37:18,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5330 treesize of output 5321 [2023-11-29 02:37:20,580 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-29 02:37:24,477 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 7 treesize of output 3 [2023-11-29 02:37:26,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-29 02:37:26,165 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 67 treesize of output 61 [2023-11-29 02:37:26,207 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 67 treesize of output 61 [2023-11-29 02:37:26,539 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2023-11-29 02:37:26,595 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 168 [2023-11-29 02:37:26,635 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 113 treesize of output 105 [2023-11-29 02:37:26,682 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 111 treesize of output 87 [2023-11-29 02:37:26,730 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 109 treesize of output 85 [2023-11-29 02:37:26,770 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 24 treesize of output 18 [2023-11-29 02:37:27,172 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 19 treesize of output 17 [2023-11-29 02:37:27,285 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 19 treesize of output 17 [2023-11-29 02:37:27,384 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 19 treesize of output 17 [2023-11-29 02:37:27,437 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 19 treesize of output 17 [2023-11-29 02:37:27,488 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 19 treesize of output 17 [2023-11-29 02:37:27,588 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 26 treesize of output 24 [2023-11-29 02:37:27,651 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 18 treesize of output 16 [2023-11-29 02:37:27,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,781 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:27,842 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 26 treesize of output 24 [2023-11-29 02:37:27,891 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 18 treesize of output 16 [2023-11-29 02:37:29,445 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 24 treesize of output 22 [2023-11-29 02:37:29,573 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 12 treesize of output 1 [2023-11-29 02:37:29,581 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 7 [2023-11-29 02:37:29,602 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 7 [2023-11-29 02:37:29,609 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 7 [2023-11-29 02:37:29,805 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 23 treesize of output 15 [2023-11-29 02:37:29,806 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 19 treesize of output 11 [2023-11-29 02:37:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 02:37:29,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:37:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966473436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:37:30,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:37:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-11-29 02:37:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134431868] [2023-11-29 02:37:30,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:37:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:37:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:37:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=752, Unknown=10, NotChecked=56, Total=930 [2023-11-29 02:37:30,226 INFO L87 Difference]: Start difference. First operand 240 states and 290 transitions. Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:37:37,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:37:39,477 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2023-11-29 02:37:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:37:39,478 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-11-29 02:37:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:37:39,479 INFO L225 Difference]: With dead ends: 257 [2023-11-29 02:37:39,480 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 02:37:39,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=227, Invalid=1325, Unknown=12, NotChecked=76, Total=1640 [2023-11-29 02:37:39,481 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 643 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 107 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:37:39,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 208 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1523 Invalid, 37 Unknown, 215 Unchecked, 7.1s Time] [2023-11-29 02:37:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 02:37:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-11-29 02:37:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2254901960784315) internal successors, (250), 219 states have internal predecessors, (250), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:37:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2023-11-29 02:37:39,519 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 36 [2023-11-29 02:37:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:37:39,519 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2023-11-29 02:37:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:37:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2023-11-29 02:37:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:37:39,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:37:39,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:37:39,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:37:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:37:39,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:37:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:37:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -424121341, now seen corresponding path program 1 times [2023-11-29 02:37:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:37:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881779150] [2023-11-29 02:37:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:37:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:37:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:40,839 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 02:37:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:37:40,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881779150] [2023-11-29 02:37:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881779150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:37:40,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:37:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:37:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546819510] [2023-11-29 02:37:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:37:40,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:37:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:37:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:37:40,841 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:37:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:37:42,617 INFO L93 Difference]: Finished difference Result 256 states and 303 transitions. [2023-11-29 02:37:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:37:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-11-29 02:37:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:37:42,619 INFO L225 Difference]: With dead ends: 256 [2023-11-29 02:37:42,619 INFO L226 Difference]: Without dead ends: 253 [2023-11-29 02:37:42,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:37:42,626 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 361 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:37:42,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 192 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:37:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-29 02:37:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2023-11-29 02:37:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 219 states have internal predecessors, (249), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 02:37:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 288 transitions. [2023-11-29 02:37:42,671 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 288 transitions. Word has length 38 [2023-11-29 02:37:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:37:42,671 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 288 transitions. [2023-11-29 02:37:42,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:37:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 288 transitions. [2023-11-29 02:37:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:37:42,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:37:42,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:37:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:37:42,673 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:37:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:37:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash -528930837, now seen corresponding path program 1 times [2023-11-29 02:37:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:37:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634674204] [2023-11-29 02:37:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:37:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 02:37:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:37:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:37:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:37:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634674204] [2023-11-29 02:37:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634674204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:37:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955338862] [2023-11-29 02:37:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:37:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:37:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:37:44,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:37:44,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:37:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:37:44,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 02:37:44,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:37:44,348 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 02:37:44,349 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 02:37:44,454 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 16 [2023-11-29 02:37:44,465 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 16 [2023-11-29 02:37:45,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 95 [2023-11-29 02:37:45,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-11-29 02:37:45,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:45,125 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 30 treesize of output 15 [2023-11-29 02:37:45,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 02:37:45,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2023-11-29 02:37:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2023-11-29 02:37:45,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 22 [2023-11-29 02:37:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 27 treesize of output 37 [2023-11-29 02:37:45,350 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-11-29 02:37:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 173 treesize of output 131 [2023-11-29 02:37:45,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:37:45,365 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2023-11-29 02:37:45,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 29 [2023-11-29 02:37:45,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-29 02:37:45,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:45,613 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-11-29 02:37:45,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2023-11-29 02:37:45,740 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 50 treesize of output 37 [2023-11-29 02:37:45,747 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 02:37:45,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-29 02:37:46,159 INFO L349 Elim1Store]: treesize reduction 112, result has 26.8 percent of original size [2023-11-29 02:37:46,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 266 treesize of output 242 [2023-11-29 02:37:46,227 INFO L349 Elim1Store]: treesize reduction 199, result has 5.2 percent of original size [2023-11-29 02:37:46,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 235 treesize of output 387 [2023-11-29 02:37:46,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:46,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:46,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:37:46,282 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2023-11-29 02:37:46,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 355 treesize of output 347 [2023-11-29 02:37:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:46,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:46,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 353 [2023-11-29 02:37:46,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:46,374 INFO L349 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2023-11-29 02:37:46,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 109 [2023-11-29 02:37:46,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 100 treesize of output 88 [2023-11-29 02:37:47,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:37:47,541 INFO L349 Elim1Store]: treesize reduction 132, result has 35.6 percent of original size [2023-11-29 02:37:47,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 545 [2023-11-29 02:37:47,658 INFO L349 Elim1Store]: treesize reduction 80, result has 30.4 percent of original size [2023-11-29 02:37:47,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 232 treesize of output 229 [2023-11-29 02:37:48,362 INFO L349 Elim1Store]: treesize reduction 166, result has 0.6 percent of original size [2023-11-29 02:37:48,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 440 [2023-11-29 02:37:48,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 81 [2023-11-29 02:37:48,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 81 [2023-11-29 02:37:48,617 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-29 02:37:48,618 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 1 case distinctions, treesize of input 422 treesize of output 359 [2023-11-29 02:37:48,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 26 [2023-11-29 02:37:48,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 26 [2023-11-29 02:37:48,711 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 17 treesize of output 13 [2023-11-29 02:37:48,736 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 113 treesize of output 99 [2023-11-29 02:37:50,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 254 treesize of output 224 [2023-11-29 02:37:50,438 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 273 treesize of output 251 [2023-11-29 02:37:50,471 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 5 treesize of output 3 [2023-11-29 02:37:50,735 INFO L349 Elim1Store]: treesize reduction 56, result has 44.6 percent of original size [2023-11-29 02:37:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 92 treesize of output 88 [2023-11-29 02:37:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:37:50,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:37:51,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1168)) (.cse1 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse2 (select (select .cse0 |c_~#gl_list~0.base|) .cse1))) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1167) |c_~#gl_list~0.base|) .cse1)) .cse2) .cse2))))) is different from false [2023-11-29 02:37:51,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4))) (let ((.cse1 (store (let ((.cse6 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3 .cse6)))) (store .cse5 |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1183) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1168)) (.cse4 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (= .cse0 (select (select .cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1182) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1185) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1184)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1167) |c_~#gl_list~0.base|) .cse4)) .cse0))))))) is different from false [2023-11-29 02:37:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955338862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:37:51,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:37:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-11-29 02:37:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319370293] [2023-11-29 02:37:51,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:37:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:37:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:37:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:37:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=892, Unknown=2, NotChecked=122, Total=1122 [2023-11-29 02:37:51,224 INFO L87 Difference]: Start difference. First operand 240 states and 288 transitions. Second operand has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:38:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:38:02,237 INFO L93 Difference]: Finished difference Result 408 states and 481 transitions. [2023-11-29 02:38:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:38:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2023-11-29 02:38:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:38:02,241 INFO L225 Difference]: With dead ends: 408 [2023-11-29 02:38:02,241 INFO L226 Difference]: Without dead ends: 402 [2023-11-29 02:38:02,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=410, Invalid=2565, Unknown=3, NotChecked=214, Total=3192 [2023-11-29 02:38:02,244 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1372 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 180 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:38:02,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 615 Invalid, 3950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 3722 Invalid, 48 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 02:38:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-11-29 02:38:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 333. [2023-11-29 02:38:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 289 states have (on average 1.207612456747405) internal successors, (349), 304 states have internal predecessors, (349), 33 states have call successors, (33), 13 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 02:38:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 397 transitions. [2023-11-29 02:38:02,332 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 397 transitions. Word has length 39 [2023-11-29 02:38:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:38:02,333 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 397 transitions. [2023-11-29 02:38:02,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:38:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 397 transitions. [2023-11-29 02:38:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 02:38:02,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:38:02,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:38:02,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:38:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:38:02,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:38:02,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:38:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 616504430, now seen corresponding path program 1 times [2023-11-29 02:38:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:38:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773049264] [2023-11-29 02:38:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:38:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:38:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:38:02,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:38:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:38:02,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:38:02,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:38:02,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:38:02,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:38:02,606 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:38:02,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:38:02,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem31 [2023-11-29 02:38:02,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem32 [2023-11-29 02:38:02,628 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem34 [2023-11-29 02:38:02,628 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 02:38:02,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem36 [2023-11-29 02:38:02,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem37 [2023-11-29 02:38:02,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:38:02 BoogieIcfgContainer [2023-11-29 02:38:02,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:38:02,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:38:02,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:38:02,641 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:38:02,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:36:46" (3/4) ... [2023-11-29 02:38:02,642 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 02:38:02,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem31 [2023-11-29 02:38:02,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem32 [2023-11-29 02:38:02,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem34 [2023-11-29 02:38:02,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-29 02:38:02,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem36 [2023-11-29 02:38:02,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem37 [2023-11-29 02:38:02,686 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:38:02,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:38:02,687 INFO L158 Benchmark]: Toolchain (without parser) took 77902.21ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 133.5MB in the beginning and 423.1MB in the end (delta: -289.6MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,688 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:38:02,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.28ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 120.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,689 INFO L158 Benchmark]: Boogie Preprocessor took 82.81ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 113.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,689 INFO L158 Benchmark]: RCFGBuilder took 574.33ms. Allocated memory is still 172.0MB. Free memory was 113.0MB in the beginning and 83.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,689 INFO L158 Benchmark]: TraceAbstraction took 76569.65ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 83.6MB in the beginning and 426.3MB in the end (delta: -342.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,690 INFO L158 Benchmark]: Witness Printer took 46.08ms. Allocated memory is still 522.2MB. Free memory was 426.3MB in the beginning and 423.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:38:02,691 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.12ms. Allocated memory is still 117.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.28ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 120.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.81ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 113.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 574.33ms. Allocated memory is still 172.0MB. Free memory was 113.0MB in the beginning and 83.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 76569.65ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 83.6MB in the beginning and 426.3MB in the end (delta: -342.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 46.08ms. Allocated memory is still 522.2MB. Free memory was 426.3MB in the beginning and 423.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem31 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem34 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem36 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem37 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem31 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem34 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem36 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem37 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=6, gl_list={3:0}, node={5:0}, value=6] [L902] node->value = value VAL [gl_list={3:0}] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=6, gl_list={3:0}, node={5:0}, value=6] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [gl_list={3:0}] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.5s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 87 mSolverCounterUnknown, 5523 SdHoareTripleChecker+Valid, 22.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5493 mSDsluCounter, 2357 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 215 IncrementalHoareTripleChecker+Unchecked, 1990 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14096 IncrementalHoareTripleChecker+Invalid, 15207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 367 mSDtfsCounter, 14096 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 273 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=12, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 211 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 429 ConstructedInterpolants, 33 QuantifiedInterpolants, 17499 SizeOfPredicates, 58 NumberOfNonLiveVariables, 897 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 02:38:02,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871eb06a-0407-4550-9946-dbafd8be9c00/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE