./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:42:18,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:42:18,694 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:42:18,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:42:18,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:42:18,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:42:18,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:42:18,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:42:18,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:42:18,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:42:18,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:42:18,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:42:18,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:42:18,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:42:18,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:42:18,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:42:18,728 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:42:18,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:42:18,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:42:18,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:42:18,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:42:18,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:42:18,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:42:18,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:42:18,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:42:18,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:42:18,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-11-28 04:42:18,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:42:19,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:42:19,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:42:19,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:42:19,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:42:19,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-28 04:42:21,969 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/7c924ee71/a8cfe9b8cd3a4ea89edff44e18c43b8f/FLAGd2f7acb5b [2024-11-28 04:42:22,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:42:22,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-28 04:42:22,414 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/7c924ee71/a8cfe9b8cd3a4ea89edff44e18c43b8f/FLAGd2f7acb5b [2024-11-28 04:42:22,426 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/7c924ee71/a8cfe9b8cd3a4ea89edff44e18c43b8f [2024-11-28 04:42:22,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:42:22,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:42:22,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:42:22,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:42:22,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:42:22,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:42:22" (1/1) ... [2024-11-28 04:42:22,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de9449b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:22, skipping insertion in model container [2024-11-28 04:42:22,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:42:22" (1/1) ... [2024-11-28 04:42:22,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:42:23,033 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,083 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,086 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,097 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,106 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,170 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,177 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,181 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,193 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,244 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,244 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,246 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,246 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:42:23,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:42:23,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:42:23,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:42:23,495 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:42:23,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23 WrapperNode [2024-11-28 04:42:23,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:42:23,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:42:23,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:42:23,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:42:23,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,623 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-28 04:42:23,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:42:23,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:42:23,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:42:23,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:42:23,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,794 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-28 04:42:23,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:42:23,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:42:23,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:42:23,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:42:23,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (1/1) ... [2024-11-28 04:42:23,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:42:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:23,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:42:23,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:42:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 04:42:23,997 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 04:42:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:42:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:42:23,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 04:42:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 04:42:23,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 04:42:23,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 04:42:23,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:42:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:42:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:42:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:42:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:42:24,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:42:24,311 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:42:24,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:42:24,338 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:42:24,376 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:42:24,402 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:42:28,068 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-28 04:42:28,068 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:42:28,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:42:28,135 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2024-11-28 04:42:28,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:42:28 BoogieIcfgContainer [2024-11-28 04:42:28,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:42:28,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:42:28,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:42:28,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:42:28,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:42:22" (1/3) ... [2024-11-28 04:42:28,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:42:28, skipping insertion in model container [2024-11-28 04:42:28,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:42:23" (2/3) ... [2024-11-28 04:42:28,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:42:28, skipping insertion in model container [2024-11-28 04:42:28,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:42:28" (3/3) ... [2024-11-28 04:42:28,145 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-11-28 04:42:28,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:42:28,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 6 procedures, 1749 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-28 04:42:28,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:42:28,248 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@53c5c16f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:42:28,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-28 04:42:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 1739 states, 1016 states have (on average 2.033464566929134) internal successors, (2066), 1729 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 04:42:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:42:28,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:28,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:42:28,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2031748298, now seen corresponding path program 1 times [2024-11-28 04:42:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007487706] [2024-11-28 04:42:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007487706] [2024-11-28 04:42:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007487706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:42:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584898463] [2024-11-28 04:42:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:28,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:42:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:28,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:42:28,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:42:28,495 INFO L87 Difference]: Start difference. First operand has 1739 states, 1016 states have (on average 2.033464566929134) internal successors, (2066), 1729 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:28,594 INFO L93 Difference]: Finished difference Result 1719 states and 1979 transitions. [2024-11-28 04:42:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:42:28,596 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:42:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:28,617 INFO L225 Difference]: With dead ends: 1719 [2024-11-28 04:42:28,617 INFO L226 Difference]: Without dead ends: 1717 [2024-11-28 04:42:28,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:42:28,626 INFO L435 NwaCegarLoop]: 1979 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:28,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:42:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-28 04:42:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2024-11-28 04:42:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1006 states have (on average 1.9413518886679921) internal successors, (1953), 1707 states have internal predecessors, (1953), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1977 transitions. [2024-11-28 04:42:28,758 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1977 transitions. Word has length 6 [2024-11-28 04:42:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 1977 transitions. [2024-11-28 04:42:28,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1977 transitions. [2024-11-28 04:42:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:42:28,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:28,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:42:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:42:28,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 04:42:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926561838] [2024-11-28 04:42:28,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926561838] [2024-11-28 04:42:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926561838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:42:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274871115] [2024-11-28 04:42:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:28,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:42:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:28,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:42:28,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:28,914 INFO L87 Difference]: Start difference. First operand 1717 states and 1977 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:30,386 INFO L93 Difference]: Finished difference Result 1947 states and 2295 transitions. [2024-11-28 04:42:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:42:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:42:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:30,395 INFO L225 Difference]: With dead ends: 1947 [2024-11-28 04:42:30,396 INFO L226 Difference]: Without dead ends: 1947 [2024-11-28 04:42:30,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:30,397 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1738 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:30,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 1921 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:42:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-28 04:42:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1625. [2024-11-28 04:42:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1006 states have (on average 1.8499005964214712) internal successors, (1861), 1615 states have internal predecessors, (1861), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1885 transitions. [2024-11-28 04:42:30,465 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1885 transitions. Word has length 6 [2024-11-28 04:42:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:30,466 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 1885 transitions. [2024-11-28 04:42:30,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1885 transitions. [2024-11-28 04:42:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:42:30,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:30,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:42:30,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:42:30,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 04:42:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798403315] [2024-11-28 04:42:30,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798403315] [2024-11-28 04:42:30,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798403315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:42:30,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408206496] [2024-11-28 04:42:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:30,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:42:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:30,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:42:30,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:30,651 INFO L87 Difference]: Start difference. First operand 1625 states and 1885 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:32,108 INFO L93 Difference]: Finished difference Result 2363 states and 2787 transitions. [2024-11-28 04:42:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:42:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:42:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:32,120 INFO L225 Difference]: With dead ends: 2363 [2024-11-28 04:42:32,120 INFO L226 Difference]: Without dead ends: 2363 [2024-11-28 04:42:32,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:32,121 INFO L435 NwaCegarLoop]: 1956 mSDtfsCounter, 1218 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:32,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 2892 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:42:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2024-11-28 04:42:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1888. [2024-11-28 04:42:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1279 states have (on average 1.8256450351837372) internal successors, (2335), 1878 states have internal predecessors, (2335), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2359 transitions. [2024-11-28 04:42:32,265 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2359 transitions. Word has length 6 [2024-11-28 04:42:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2359 transitions. [2024-11-28 04:42:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2359 transitions. [2024-11-28 04:42:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:42:32,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:32,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:42:32,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:42:32,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1957151634, now seen corresponding path program 1 times [2024-11-28 04:42:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:32,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267448013] [2024-11-28 04:42:32,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:32,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267448013] [2024-11-28 04:42:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267448013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:42:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138919703] [2024-11-28 04:42:32,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:32,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:42:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:32,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:42:32,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:32,339 INFO L87 Difference]: Start difference. First operand 1888 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:32,425 INFO L93 Difference]: Finished difference Result 3757 states and 4699 transitions. [2024-11-28 04:42:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:42:32,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:42:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:32,441 INFO L225 Difference]: With dead ends: 3757 [2024-11-28 04:42:32,441 INFO L226 Difference]: Without dead ends: 3757 [2024-11-28 04:42:32,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:32,445 INFO L435 NwaCegarLoop]: 2384 mSDtfsCounter, 1831 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:32,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 4249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:42:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2024-11-28 04:42:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 1890. [2024-11-28 04:42:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1281 states have (on average 1.8243559718969555) internal successors, (2337), 1880 states have internal predecessors, (2337), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2361 transitions. [2024-11-28 04:42:32,512 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2361 transitions. Word has length 6 [2024-11-28 04:42:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:32,512 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2361 transitions. [2024-11-28 04:42:32,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2361 transitions. [2024-11-28 04:42:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:42:32,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:32,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:42:32,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:32,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 04:42:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139130515] [2024-11-28 04:42:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139130515] [2024-11-28 04:42:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139130515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:32,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:42:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103219783] [2024-11-28 04:42:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:32,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:42:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:32,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:42:32,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:42:32,639 INFO L87 Difference]: Start difference. First operand 1890 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:34,140 INFO L93 Difference]: Finished difference Result 1917 states and 2415 transitions. [2024-11-28 04:42:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:42:34,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:42:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:34,150 INFO L225 Difference]: With dead ends: 1917 [2024-11-28 04:42:34,150 INFO L226 Difference]: Without dead ends: 1917 [2024-11-28 04:42:34,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:34,152 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 2006 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:34,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2181 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:42:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2024-11-28 04:42:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1867. [2024-11-28 04:42:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1281 states have (on average 1.8064012490241999) internal successors, (2314), 1857 states have internal predecessors, (2314), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2338 transitions. [2024-11-28 04:42:34,202 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2338 transitions. Word has length 12 [2024-11-28 04:42:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:34,202 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2338 transitions. [2024-11-28 04:42:34,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2338 transitions. [2024-11-28 04:42:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:42:34,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:34,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:34,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:42:34,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 04:42:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556154060] [2024-11-28 04:42:34,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:34,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556154060] [2024-11-28 04:42:34,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556154060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:34,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:42:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006855293] [2024-11-28 04:42:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:34,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:42:34,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:34,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:42:34,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:34,330 INFO L87 Difference]: Start difference. First operand 1867 states and 2338 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:34,371 INFO L93 Difference]: Finished difference Result 1792 states and 2235 transitions. [2024-11-28 04:42:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:42:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:42:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:34,379 INFO L225 Difference]: With dead ends: 1792 [2024-11-28 04:42:34,379 INFO L226 Difference]: Without dead ends: 1792 [2024-11-28 04:42:34,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:34,380 INFO L435 NwaCegarLoop]: 1737 mSDtfsCounter, 61 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:34,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3421 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:42:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-28 04:42:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2024-11-28 04:42:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1218 states have (on average 1.8152709359605912) internal successors, (2211), 1782 states have internal predecessors, (2211), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2235 transitions. [2024-11-28 04:42:34,422 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2235 transitions. Word has length 12 [2024-11-28 04:42:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:34,422 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2235 transitions. [2024-11-28 04:42:34,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2235 transitions. [2024-11-28 04:42:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:42:34,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:34,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:42:34,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1786670129, now seen corresponding path program 1 times [2024-11-28 04:42:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4681598] [2024-11-28 04:42:34,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4681598] [2024-11-28 04:42:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4681598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:42:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965589714] [2024-11-28 04:42:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:42:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:34,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:42:34,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:42:34,527 INFO L87 Difference]: Start difference. First operand 1792 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:34,619 INFO L93 Difference]: Finished difference Result 1777 states and 2213 transitions. [2024-11-28 04:42:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:42:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 04:42:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:34,627 INFO L225 Difference]: With dead ends: 1777 [2024-11-28 04:42:34,627 INFO L226 Difference]: Without dead ends: 1777 [2024-11-28 04:42:34,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:34,628 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 45 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:34,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5074 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:42:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-28 04:42:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2024-11-28 04:42:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1210 states have (on average 1.809090909090909) internal successors, (2189), 1767 states have internal predecessors, (2189), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2213 transitions. [2024-11-28 04:42:34,671 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2213 transitions. Word has length 14 [2024-11-28 04:42:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:34,671 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2213 transitions. [2024-11-28 04:42:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2213 transitions. [2024-11-28 04:42:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:42:34,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:34,673 INFO L218 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] [2024-11-28 04:42:34,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:42:34,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 393992639, now seen corresponding path program 1 times [2024-11-28 04:42:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066971653] [2024-11-28 04:42:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066971653] [2024-11-28 04:42:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066971653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:42:34,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383638952] [2024-11-28 04:42:34,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:34,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:42:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:34,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:42:34,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:42:34,940 INFO L87 Difference]: Start difference. First operand 1777 states and 2213 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:36,615 INFO L93 Difference]: Finished difference Result 2298 states and 2714 transitions. [2024-11-28 04:42:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:42:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 04:42:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:36,623 INFO L225 Difference]: With dead ends: 2298 [2024-11-28 04:42:36,623 INFO L226 Difference]: Without dead ends: 2298 [2024-11-28 04:42:36,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:36,624 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 1223 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 3390 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:36,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 3390 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 04:42:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-28 04:42:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1773. [2024-11-28 04:42:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1210 states have (on average 1.8057851239669422) internal successors, (2185), 1763 states have internal predecessors, (2185), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2209 transitions. [2024-11-28 04:42:36,666 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2209 transitions. Word has length 28 [2024-11-28 04:42:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:36,666 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2209 transitions. [2024-11-28 04:42:36,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2209 transitions. [2024-11-28 04:42:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:42:36,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:36,668 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:42:36,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 537217013, now seen corresponding path program 1 times [2024-11-28 04:42:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773679238] [2024-11-28 04:42:36,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773679238] [2024-11-28 04:42:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773679238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:42:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274026649] [2024-11-28 04:42:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:42:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:36,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:42:36,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:42:36,832 INFO L87 Difference]: Start difference. First operand 1773 states and 2209 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:36,898 INFO L93 Difference]: Finished difference Result 1767 states and 2199 transitions. [2024-11-28 04:42:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:42:36,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-28 04:42:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:36,905 INFO L225 Difference]: With dead ends: 1767 [2024-11-28 04:42:36,905 INFO L226 Difference]: Without dead ends: 1767 [2024-11-28 04:42:36,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:36,906 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 21 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:36,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5060 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:42:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2024-11-28 04:42:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2024-11-28 04:42:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1204 states have (on average 1.8064784053156147) internal successors, (2175), 1757 states have internal predecessors, (2175), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2199 transitions. [2024-11-28 04:42:36,942 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2199 transitions. Word has length 62 [2024-11-28 04:42:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:36,943 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2199 transitions. [2024-11-28 04:42:36,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2199 transitions. [2024-11-28 04:42:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:42:36,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:36,945 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:42:36,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1829680703, now seen corresponding path program 1 times [2024-11-28 04:42:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659406530] [2024-11-28 04:42:36,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659406530] [2024-11-28 04:42:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659406530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:37,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:42:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569624435] [2024-11-28 04:42:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:42:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:42:37,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:37,134 INFO L87 Difference]: Start difference. First operand 1767 states and 2199 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:37,184 INFO L93 Difference]: Finished difference Result 1860 states and 2319 transitions. [2024-11-28 04:42:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:42:37,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 04:42:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:37,191 INFO L225 Difference]: With dead ends: 1860 [2024-11-28 04:42:37,191 INFO L226 Difference]: Without dead ends: 1860 [2024-11-28 04:42:37,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:42:37,193 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 54 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:37,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3397 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:42:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-28 04:42:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2024-11-28 04:42:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1297 states have (on average 1.7694680030840402) internal successors, (2295), 1850 states have internal predecessors, (2295), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2319 transitions. [2024-11-28 04:42:37,231 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2319 transitions. Word has length 70 [2024-11-28 04:42:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2319 transitions. [2024-11-28 04:42:37,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2319 transitions. [2024-11-28 04:42:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:42:37,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:37,236 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:37,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:42:37,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:37,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -696902437, now seen corresponding path program 1 times [2024-11-28 04:42:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917559706] [2024-11-28 04:42:37,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:37,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917559706] [2024-11-28 04:42:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917559706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:42:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385823700] [2024-11-28 04:42:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:37,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:42:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:37,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:42:37,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:37,963 INFO L87 Difference]: Start difference. First operand 1860 states and 2319 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:39,445 INFO L93 Difference]: Finished difference Result 1776 states and 2235 transitions. [2024-11-28 04:42:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:42:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 04:42:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:39,450 INFO L225 Difference]: With dead ends: 1776 [2024-11-28 04:42:39,450 INFO L226 Difference]: Without dead ends: 1776 [2024-11-28 04:42:39,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:39,451 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 3048 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:39,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 1614 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:42:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-28 04:42:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1503. [2024-11-28 04:42:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1024 states have (on average 1.6865234375) internal successors, (1727), 1493 states have internal predecessors, (1727), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1751 transitions. [2024-11-28 04:42:39,481 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1751 transitions. Word has length 73 [2024-11-28 04:42:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:39,481 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1751 transitions. [2024-11-28 04:42:39,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1751 transitions. [2024-11-28 04:42:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 04:42:39,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:39,482 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:39,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:42:39,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 567023701, now seen corresponding path program 1 times [2024-11-28 04:42:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028284918] [2024-11-28 04:42:39,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:39,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028284918] [2024-11-28 04:42:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028284918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:42:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88690608] [2024-11-28 04:42:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:42:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:40,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:42:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:40,112 INFO L87 Difference]: Start difference. First operand 1503 states and 1751 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:41,685 INFO L93 Difference]: Finished difference Result 1502 states and 1750 transitions. [2024-11-28 04:42:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:42:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 04:42:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:41,690 INFO L225 Difference]: With dead ends: 1502 [2024-11-28 04:42:41,690 INFO L226 Difference]: Without dead ends: 1502 [2024-11-28 04:42:41,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:41,691 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:41,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4804 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 04:42:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-28 04:42:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2024-11-28 04:42:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1024 states have (on average 1.685546875) internal successors, (1726), 1492 states have internal predecessors, (1726), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 04:42:41,715 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 78 [2024-11-28 04:42:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:41,716 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 04:42:41,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 04:42:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 04:42:41,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:41,717 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:41,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:42:41,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash 567023700, now seen corresponding path program 1 times [2024-11-28 04:42:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299803209] [2024-11-28 04:42:41,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299803209] [2024-11-28 04:42:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299803209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:42:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586431073] [2024-11-28 04:42:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:42,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:42:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:42,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:42:42,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:42,091 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:43,308 INFO L93 Difference]: Finished difference Result 1501 states and 1749 transitions. [2024-11-28 04:42:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:42:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 04:42:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:43,313 INFO L225 Difference]: With dead ends: 1501 [2024-11-28 04:42:43,313 INFO L226 Difference]: Without dead ends: 1501 [2024-11-28 04:42:43,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:43,315 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:43,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4782 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 04:42:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-28 04:42:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2024-11-28 04:42:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1023 states have (on average 1.686217008797654) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-28 04:42:43,339 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 78 [2024-11-28 04:42:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:43,339 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-28 04:42:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-28 04:42:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 04:42:43,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:43,340 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:43,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:42:43,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500027, now seen corresponding path program 1 times [2024-11-28 04:42:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445588166] [2024-11-28 04:42:43,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445588166] [2024-11-28 04:42:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445588166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:42:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905724389] [2024-11-28 04:42:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:43,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:42:43,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:43,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:42:43,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:42:43,662 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:45,151 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 04:42:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:42:45,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 04:42:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:45,157 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 04:42:45,157 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 04:42:45,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:42:45,158 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 13 mSDsluCounter, 4846 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6452 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:45,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6452 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:42:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 04:42:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1507. [2024-11-28 04:42:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1028 states have (on average 1.6848249027237354) internal successors, (1732), 1496 states have internal predecessors, (1732), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 04:42:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1762 transitions. [2024-11-28 04:42:45,186 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1762 transitions. Word has length 86 [2024-11-28 04:42:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:45,187 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1762 transitions. [2024-11-28 04:42:45,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1762 transitions. [2024-11-28 04:42:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 04:42:45,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:45,188 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:45,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:42:45,189 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:45,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500028, now seen corresponding path program 1 times [2024-11-28 04:42:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671723450] [2024-11-28 04:42:45,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671723450] [2024-11-28 04:42:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671723450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:42:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393526762] [2024-11-28 04:42:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:42:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:45,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:42:45,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:45,922 INFO L87 Difference]: Start difference. First operand 1507 states and 1762 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:48,122 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2024-11-28 04:42:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:42:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 04:42:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:48,133 INFO L225 Difference]: With dead ends: 1507 [2024-11-28 04:42:48,134 INFO L226 Difference]: Without dead ends: 1507 [2024-11-28 04:42:48,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:42:48,134 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 8 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6139 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:48,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6139 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 04:42:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-28 04:42:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2024-11-28 04:42:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1028 states have (on average 1.683852140077821) internal successors, (1731), 1496 states have internal predecessors, (1731), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 04:42:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1761 transitions. [2024-11-28 04:42:48,180 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1761 transitions. Word has length 86 [2024-11-28 04:42:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:48,181 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1761 transitions. [2024-11-28 04:42:48,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:42:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1761 transitions. [2024-11-28 04:42:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:42:48,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:48,182 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:48,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:42:48,183 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:48,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933393, now seen corresponding path program 1 times [2024-11-28 04:42:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247878636] [2024-11-28 04:42:48,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247878636] [2024-11-28 04:42:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247878636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127834558] [2024-11-28 04:42:48,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:48,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:48,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:48,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:42:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:49,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 04:42:49,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:49,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:42:49,456 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 [2024-11-28 04:42:49,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:42:49,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:49,548 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 42 treesize of output 41 [2024-11-28 04:42:49,584 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 31 treesize of output 13 [2024-11-28 04:42:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:49,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:49,651 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:42:49,651 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 21 treesize of output 20 [2024-11-28 04:42:49,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 04:42:49,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127834558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:49,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:42:49,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 04:42:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643382790] [2024-11-28 04:42:49,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:42:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:49,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:42:49,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 04:42:49,664 INFO L87 Difference]: Start difference. First operand 1507 states and 1761 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:42:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:52,944 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-28 04:42:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:42:52,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-28 04:42:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:52,951 INFO L225 Difference]: With dead ends: 1506 [2024-11-28 04:42:52,952 INFO L226 Difference]: Without dead ends: 1506 [2024-11-28 04:42:52,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 04:42:52,953 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 1545 mSDsluCounter, 8196 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 9243 SdHoareTripleChecker+Invalid, 5409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:52,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 9243 Invalid, 5409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 04:42:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-28 04:42:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-28 04:42:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1028 states have (on average 1.6828793774319066) internal successors, (1730), 1495 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 04:42:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1760 transitions. [2024-11-28 04:42:52,975 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1760 transitions. Word has length 87 [2024-11-28 04:42:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1760 transitions. [2024-11-28 04:42:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:42:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1760 transitions. [2024-11-28 04:42:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 04:42:52,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:52,977 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:52,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:42:53,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:53,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:53,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933392, now seen corresponding path program 1 times [2024-11-28 04:42:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063431499] [2024-11-28 04:42:53,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063431499] [2024-11-28 04:42:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063431499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596152611] [2024-11-28 04:42:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:54,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:54,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:54,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:54,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:42:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:54,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 04:42:54,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:54,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:54,465 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 8 treesize of output 1 [2024-11-28 04:42:54,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:42:54,478 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 [2024-11-28 04:42:54,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:42:54,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:42:54,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:42:54,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:42:54,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:54,757 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 62 treesize of output 57 [2024-11-28 04:42:54,764 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 13 [2024-11-28 04:42:54,817 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 31 treesize of output 13 [2024-11-28 04:42:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:42:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:54,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:54,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_668 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:42:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596152611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:54,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:42:54,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 04:42:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708413447] [2024-11-28 04:42:54,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:54,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:42:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:42:54,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:42:54,993 INFO L87 Difference]: Start difference. First operand 1506 states and 1760 transitions. Second operand has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:42:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:59,555 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 04:42:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:42:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-28 04:42:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:59,559 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 04:42:59,559 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 04:42:59,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-28 04:42:59,560 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1544 mSDsluCounter, 7870 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 7376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:59,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8922 Invalid, 7376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 7333 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 04:42:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 04:42:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1504. [2024-11-28 04:42:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1027 states have (on average 1.6825705939629991) internal successors, (1728), 1493 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:42:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1752 transitions. [2024-11-28 04:42:59,581 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1752 transitions. Word has length 87 [2024-11-28 04:42:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:59,582 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1752 transitions. [2024-11-28 04:42:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:42:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1752 transitions. [2024-11-28 04:42:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 04:42:59,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:59,583 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:59,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:42:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:59,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:42:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -325374910, now seen corresponding path program 1 times [2024-11-28 04:42:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137558368] [2024-11-28 04:42:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137558368] [2024-11-28 04:43:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137558368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:00,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 04:43:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410209902] [2024-11-28 04:43:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:43:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:00,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:43:00,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:43:00,398 INFO L87 Difference]: Start difference. First operand 1504 states and 1752 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:03,680 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 04:43:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:43:03,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 04:43:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:03,685 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 04:43:03,685 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 04:43:03,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:43:03,686 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1550 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 9207 SdHoareTripleChecker+Invalid, 5442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:03,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 9207 Invalid, 5442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5416 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 04:43:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 04:43:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-28 04:43:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6792270531400966) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-28 04:43:03,711 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 89 [2024-11-28 04:43:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:03,711 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-28 04:43:03,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-28 04:43:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 04:43:03,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:03,713 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:03,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:43:03,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash -325374909, now seen corresponding path program 1 times [2024-11-28 04:43:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738599751] [2024-11-28 04:43:03,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738599751] [2024-11-28 04:43:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738599751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:04,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:04,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:43:04,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359685375] [2024-11-28 04:43:04,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:04,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:43:04,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:04,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:43:04,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:43:04,636 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:08,913 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 04:43:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:43:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 04:43:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:08,918 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 04:43:08,918 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 04:43:08,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:43:08,919 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 1544 mSDsluCounter, 7056 mSDsCounter, 0 mSdLazyCounter, 6475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8109 SdHoareTripleChecker+Invalid, 6499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:08,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8109 Invalid, 6499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6475 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 04:43:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 04:43:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 04:43:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6782608695652175) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 04:43:08,952 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 89 [2024-11-28 04:43:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:08,952 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 04:43:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 04:43:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 04:43:08,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:08,954 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:08,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:43:08,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183182, now seen corresponding path program 1 times [2024-11-28 04:43:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635726855] [2024-11-28 04:43:08,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635726855] [2024-11-28 04:43:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635726855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321528038] [2024-11-28 04:43:09,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:09,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:09,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:43:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:43:09,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:10,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:43:10,119 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 [2024-11-28 04:43:10,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:43:10,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:10,201 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 42 treesize of output 41 [2024-11-28 04:43:10,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:10,265 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 42 treesize of output 41 [2024-11-28 04:43:10,284 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 31 treesize of output 13 [2024-11-28 04:43:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:10,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:43:10,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:43:10,396 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 04:43:10,396 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 33 treesize of output 32 [2024-11-28 04:43:10,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_929))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 04:43:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321528038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:10,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:43:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 04:43:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156163596] [2024-11-28 04:43:10,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:43:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:43:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:43:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-11-28 04:43:10,411 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:14,487 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 04:43:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:43:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-28 04:43:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:14,491 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 04:43:14,492 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 04:43:14,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=454, Unknown=6, NotChecked=90, Total=650 [2024-11-28 04:43:14,492 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1533 mSDsluCounter, 11207 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 12253 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:14,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 12253 Invalid, 7210 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7185 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 04:43:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 04:43:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-28 04:43:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1035 states have (on average 1.6772946859903382) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-28 04:43:14,512 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 90 [2024-11-28 04:43:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-28 04:43:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-28 04:43:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 04:43:14,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:14,513 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:14,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:43:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:14,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:14,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183183, now seen corresponding path program 1 times [2024-11-28 04:43:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791177633] [2024-11-28 04:43:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:15,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:15,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791177633] [2024-11-28 04:43:15,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791177633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:15,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687309627] [2024-11-28 04:43:15,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:15,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:15,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:43:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 04:43:16,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:16,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:16,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:43:16,171 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 [2024-11-28 04:43:16,184 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 8 treesize of output 1 [2024-11-28 04:43:16,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:43:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:43:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:43:16,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:43:16,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:16,427 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 62 treesize of output 57 [2024-11-28 04:43:16,434 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 13 [2024-11-28 04:43:16,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:16,534 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 62 treesize of output 57 [2024-11-28 04:43:16,540 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 13 [2024-11-28 04:43:16,568 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 31 treesize of output 13 [2024-11-28 04:43:16,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:43:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:16,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:43:16,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:43:16,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 04:43:16,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 04:43:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687309627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:16,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:43:16,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-28 04:43:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356883343] [2024-11-28 04:43:16,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:43:16,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:43:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:16,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:43:16,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2024-11-28 04:43:16,761 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:43:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:21,777 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-28 04:43:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:43:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-28 04:43:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:21,780 INFO L225 Difference]: With dead ends: 1514 [2024-11-28 04:43:21,780 INFO L226 Difference]: Without dead ends: 1514 [2024-11-28 04:43:21,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2024-11-28 04:43:21,781 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1540 mSDsluCounter, 6854 mSDsCounter, 0 mSdLazyCounter, 6710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 7905 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 6710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:21,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 7905 Invalid, 6749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 6710 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-28 04:43:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-28 04:43:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1502. [2024-11-28 04:43:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1027 states have (on average 1.6806231742940603) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:43:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 04:43:21,805 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 90 [2024-11-28 04:43:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 04:43:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:43:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 04:43:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 04:43:21,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:21,807 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:21,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:43:22,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:22,011 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:22,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 497879810, now seen corresponding path program 1 times [2024-11-28 04:43:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:22,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544699640] [2024-11-28 04:43:22,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544699640] [2024-11-28 04:43:22,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544699640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:22,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:22,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:43:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969023412] [2024-11-28 04:43:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:22,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:43:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:22,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:43:22,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:43:22,662 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:27,084 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 04:43:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:43:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 04:43:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:27,090 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 04:43:27,091 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 04:43:27,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:43:27,093 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1565 mSDsluCounter, 10228 mSDsCounter, 0 mSdLazyCounter, 6584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 11273 SdHoareTripleChecker+Invalid, 6609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:27,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 11273 Invalid, 6609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6584 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 04:43:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 04:43:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1514. [2024-11-28 04:43:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1038 states have (on average 1.6753371868978806) internal successors, (1739), 1502 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1764 transitions. [2024-11-28 04:43:27,115 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1764 transitions. Word has length 92 [2024-11-28 04:43:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:27,116 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1764 transitions. [2024-11-28 04:43:27,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1764 transitions. [2024-11-28 04:43:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 04:43:27,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:27,118 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:27,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:43:27,118 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:27,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash 497879811, now seen corresponding path program 1 times [2024-11-28 04:43:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:27,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338162201] [2024-11-28 04:43:27,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338162201] [2024-11-28 04:43:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338162201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:28,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:28,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:43:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122715334] [2024-11-28 04:43:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:28,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:43:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:43:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:43:28,341 INFO L87 Difference]: Start difference. First operand 1514 states and 1764 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:33,918 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 04:43:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:43:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 04:43:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:33,922 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 04:43:33,923 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 04:43:33,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:43:33,924 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1563 mSDsluCounter, 7053 mSDsCounter, 0 mSdLazyCounter, 6441 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 8105 SdHoareTripleChecker+Invalid, 6465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:33,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 8105 Invalid, 6465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6441 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 04:43:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 04:43:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 04:43:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1038 states have (on average 1.674373795761079) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 04:43:33,949 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 92 [2024-11-28 04:43:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:33,949 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 04:43:33,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 04:43:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 04:43:33,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:33,951 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:33,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 04:43:33,951 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 891975286, now seen corresponding path program 1 times [2024-11-28 04:43:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542653078] [2024-11-28 04:43:33,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542653078] [2024-11-28 04:43:35,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542653078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658437396] [2024-11-28 04:43:35,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:35,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:35,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:43:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:35,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:43:35,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:35,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:43:35,578 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 [2024-11-28 04:43:35,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:43:35,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:35,657 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 31 treesize of output 32 [2024-11-28 04:43:35,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:35,703 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 31 treesize of output 32 [2024-11-28 04:43:35,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:35,768 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 42 treesize of output 41 [2024-11-28 04:43:35,789 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 31 treesize of output 13 [2024-11-28 04:43:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:35,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:43:35,820 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:43:35,820 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 21 treesize of output 20 [2024-11-28 04:43:35,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-28 04:43:35,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1358)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:43:35,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:43:35,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1362))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1358)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:43:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658437396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:35,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:43:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 04:43:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861083432] [2024-11-28 04:43:35,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:43:35,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:43:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:35,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:43:35,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=231, Unknown=8, NotChecked=132, Total=420 [2024-11-28 04:43:35,953 INFO L87 Difference]: Start difference. First operand 1514 states and 1763 transitions. Second operand has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:39,861 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 04:43:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:43:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-28 04:43:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:39,864 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 04:43:39,864 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 04:43:39,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=464, Unknown=8, NotChecked=188, Total=756 [2024-11-28 04:43:39,868 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1534 mSDsluCounter, 8204 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 9255 SdHoareTripleChecker+Invalid, 5360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:39,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 9255 Invalid, 5360 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 04:43:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 04:43:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 04:43:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1038 states have (on average 1.6734104046242775) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 04:43:39,891 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 93 [2024-11-28 04:43:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 04:43:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 04:43:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 04:43:39,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:39,893 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:39,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:43:40,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:40,094 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 891975287, now seen corresponding path program 1 times [2024-11-28 04:43:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037423489] [2024-11-28 04:43:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:40,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037423489] [2024-11-28 04:43:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037423489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904668504] [2024-11-28 04:43:41,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:41,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:41,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:41,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:41,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:43:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:41,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 04:43:41,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:41,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:41,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:43:41,810 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 [2024-11-28 04:43:41,820 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 8 treesize of output 1 [2024-11-28 04:43:41,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:43:41,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:43:41,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:43:41,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:43:42,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:42,109 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 62 treesize of output 57 [2024-11-28 04:43:42,131 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 13 [2024-11-28 04:43:42,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:42,331 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 62 treesize of output 57 [2024-11-28 04:43:42,340 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 13 [2024-11-28 04:43:42,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:42,414 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 62 treesize of output 57 [2024-11-28 04:43:42,419 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 13 [2024-11-28 04:43:42,442 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 31 treesize of output 13 [2024-11-28 04:43:42,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:43:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:42,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:43:42,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 04:43:42,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 04:43:42,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1516) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1516) .cse1 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:43:42,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1515))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1516) .cse1 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1516) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 04:43:42,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1524))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse0 v_ArrVal_1516) (select (select (store .cse1 .cse0 v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1524))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1515))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse3 v_ArrVal_1516) .cse4 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 04:43:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904668504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:42,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:43:42,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-28 04:43:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708019504] [2024-11-28 04:43:42,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:43:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:43:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:42,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:43:42,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-28 04:43:42,655 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:43:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:49,275 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 04:43:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:43:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-28 04:43:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:49,278 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 04:43:49,279 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 04:43:49,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-28 04:43:49,280 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1533 mSDsluCounter, 10469 mSDsCounter, 0 mSdLazyCounter, 9486 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 11519 SdHoareTripleChecker+Invalid, 9512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:49,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 11519 Invalid, 9512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 9486 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 04:43:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 04:43:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1500. [2024-11-28 04:43:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1027 states have (on average 1.6786757546251216) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:43:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-28 04:43:49,298 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 93 [2024-11-28 04:43:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:49,299 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-28 04:43:49,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:43:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-28 04:43:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:43:49,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:49,300 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:49,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:43:49,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:49,504 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:49,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990121, now seen corresponding path program 1 times [2024-11-28 04:43:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693371924] [2024-11-28 04:43:49,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693371924] [2024-11-28 04:43:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693371924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:43:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180359882] [2024-11-28 04:43:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:43:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:50,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:43:50,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:43:50,295 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:54,266 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 04:43:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:43:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 04:43:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:54,270 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 04:43:54,270 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 04:43:54,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:43:54,271 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1566 mSDsluCounter, 11198 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 12242 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:54,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 12242 Invalid, 7198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 04:43:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 04:43:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2024-11-28 04:43:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1041 states have (on average 1.6714697406340058) internal successors, (1740), 1503 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1765 transitions. [2024-11-28 04:43:54,290 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1765 transitions. Word has length 95 [2024-11-28 04:43:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:54,290 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1765 transitions. [2024-11-28 04:43:54,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1765 transitions. [2024-11-28 04:43:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 04:43:54,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:54,292 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 04:43:54,292 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990122, now seen corresponding path program 1 times [2024-11-28 04:43:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711786957] [2024-11-28 04:43:54,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:55,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711786957] [2024-11-28 04:43:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711786957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:43:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340720758] [2024-11-28 04:43:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:55,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:43:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:55,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:43:55,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:43:55,291 INFO L87 Difference]: Start difference. First operand 1515 states and 1765 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:58,606 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 04:43:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:43:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 04:43:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:58,610 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 04:43:58,610 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 04:43:58,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:43:58,611 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1565 mSDsluCounter, 5265 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:58,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 6316 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 04:43:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 04:43:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2024-11-28 04:43:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1041 states have (on average 1.670509125840538) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:43:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1764 transitions. [2024-11-28 04:43:58,639 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1764 transitions. Word has length 95 [2024-11-28 04:43:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1764 transitions. [2024-11-28 04:43:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:43:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1764 transitions. [2024-11-28 04:43:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:43:58,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:58,641 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:58,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 04:43:58,641 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:43:58,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -126271627, now seen corresponding path program 1 times [2024-11-28 04:43:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99435593] [2024-11-28 04:43:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:43:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99435593] [2024-11-28 04:43:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99435593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370660451] [2024-11-28 04:43:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:59,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:59,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:43:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:59,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:43:59,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:59,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:59,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:43:59,886 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 [2024-11-28 04:43:59,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:43:59,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:43:59,991 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 42 treesize of output 41 [2024-11-28 04:44:00,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:00,049 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 42 treesize of output 41 [2024-11-28 04:44:00,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:00,105 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 42 treesize of output 41 [2024-11-28 04:44:00,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:00,166 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 42 treesize of output 41 [2024-11-28 04:44:00,180 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 31 treesize of output 13 [2024-11-28 04:44:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:00,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:00,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 04:44:00,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:44:00,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1829))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:44:00,424 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 04:44:00,424 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 105 treesize of output 104 [2024-11-28 04:44:00,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1834))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 04:44:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370660451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:00,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:44:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-28 04:44:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51039101] [2024-11-28 04:44:00,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:44:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:44:00,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=445, Unknown=31, NotChecked=188, Total=756 [2024-11-28 04:44:00,439 INFO L87 Difference]: Start difference. First operand 1515 states and 1764 transitions. Second operand has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:44:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:05,275 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 04:44:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:44:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 04:44:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:05,279 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 04:44:05,279 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 04:44:05,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=859, Unknown=38, NotChecked=260, Total=1332 [2024-11-28 04:44:05,280 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1531 mSDsluCounter, 14258 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 15302 SdHoareTripleChecker+Invalid, 8935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:05,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 15302 Invalid, 8935 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 8909 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 04:44:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 04:44:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 04:44:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1041 states have (on average 1.66954851104707) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:44:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 04:44:05,298 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 96 [2024-11-28 04:44:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:05,298 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 04:44:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:44:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 04:44:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:44:05,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:05,299 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:05,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:44:05,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 04:44:05,500 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:05,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -126271626, now seen corresponding path program 1 times [2024-11-28 04:44:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38637125] [2024-11-28 04:44:05,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38637125] [2024-11-28 04:44:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38637125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526265109] [2024-11-28 04:44:06,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:06,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:06,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:06,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:44:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:06,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 04:44:06,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:06,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:44:06,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:44:06,951 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 [2024-11-28 04:44:06,959 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 8 treesize of output 1 [2024-11-28 04:44:06,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:44:06,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:44:07,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:44:07,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:44:07,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:07,244 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 62 treesize of output 57 [2024-11-28 04:44:07,252 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 13 [2024-11-28 04:44:07,349 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:07,350 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 62 treesize of output 57 [2024-11-28 04:44:07,356 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 13 [2024-11-28 04:44:07,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:07,417 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 62 treesize of output 57 [2024-11-28 04:44:07,421 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 13 [2024-11-28 04:44:07,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:07,483 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 62 treesize of output 57 [2024-11-28 04:44:07,487 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 13 [2024-11-28 04:44:07,505 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 31 treesize of output 13 [2024-11-28 04:44:07,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:44:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:07,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:07,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2004 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:44:07,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:44:07,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 04:44:07,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse5 v_ArrVal_2002) (select (select (store .cse6 .cse5 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 04:44:08,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1999))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2001))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2002) .cse2 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1999))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse7 v_ArrVal_2000) .cse8 v_ArrVal_2002) (select (select (store .cse9 .cse8 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2004))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 04:44:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526265109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:08,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:44:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-28 04:44:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664679283] [2024-11-28 04:44:08,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:08,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:44:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:08,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:44:08,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=635, Unknown=21, NotChecked=280, Total=1056 [2024-11-28 04:44:08,012 INFO L87 Difference]: Start difference. First operand 1514 states and 1763 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:14,263 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 04:44:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:44:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-28 04:44:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:14,266 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 04:44:14,266 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 04:44:14,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=994, Unknown=21, NotChecked=350, Total=1560 [2024-11-28 04:44:14,267 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1533 mSDsluCounter, 9493 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10542 SdHoareTripleChecker+Invalid, 8936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 8909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:14,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10542 Invalid, 8936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 8909 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 04:44:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 04:44:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1498. [2024-11-28 04:44:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1027 states have (on average 1.676728334956183) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:44:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-28 04:44:14,281 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 96 [2024-11-28 04:44:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:14,281 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-28 04:44:14,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-28 04:44:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:44:14,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:14,282 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:14,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:44:14,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 04:44:14,482 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:14,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991275, now seen corresponding path program 1 times [2024-11-28 04:44:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706793650] [2024-11-28 04:44:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706793650] [2024-11-28 04:44:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706793650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 04:44:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196871210] [2024-11-28 04:44:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:15,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:44:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:15,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:44:15,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:44:15,327 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:17,816 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 04:44:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:44:17,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 04:44:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:17,822 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 04:44:17,823 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 04:44:17,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:44:17,824 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1569 mSDsluCounter, 6095 mSDsCounter, 0 mSdLazyCounter, 4200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 7144 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:17,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 7144 Invalid, 4227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4200 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 04:44:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 04:44:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1517. [2024-11-28 04:44:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1045 states have (on average 1.6669856459330143) internal successors, (1742), 1505 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:44:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1767 transitions. [2024-11-28 04:44:17,847 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1767 transitions. Word has length 99 [2024-11-28 04:44:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1767 transitions. [2024-11-28 04:44:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1767 transitions. [2024-11-28 04:44:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 04:44:17,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:17,849 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 04:44:17,849 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991276, now seen corresponding path program 1 times [2024-11-28 04:44:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469699176] [2024-11-28 04:44:17,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469699176] [2024-11-28 04:44:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469699176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:44:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466655183] [2024-11-28 04:44:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:44:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:19,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:44:19,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:44:19,183 INFO L87 Difference]: Start difference. First operand 1517 states and 1767 transitions. Second operand has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:24,290 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 04:44:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:44:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 04:44:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:24,294 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 04:44:24,294 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 04:44:24,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:44:24,295 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1548 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 8079 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 9717 SdHoareTripleChecker+Invalid, 8104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:24,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 9717 Invalid, 8104 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8079 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 04:44:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 04:44:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 04:44:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1045 states have (on average 1.6660287081339713) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:44:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 04:44:24,312 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 99 [2024-11-28 04:44:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:24,312 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 04:44:24,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:44:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 04:44:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 04:44:24,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:24,313 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:24,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 04:44:24,314 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020361, now seen corresponding path program 1 times [2024-11-28 04:44:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243755679] [2024-11-28 04:44:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:25,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243755679] [2024-11-28 04:44:25,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243755679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603577263] [2024-11-28 04:44:25,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:25,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:25,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:25,249 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:25,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:44:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:25,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:44:25,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:25,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:44:25,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:44:25,690 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 [2024-11-28 04:44:25,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:44:25,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:25,801 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 42 treesize of output 41 [2024-11-28 04:44:25,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:25,853 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 42 treesize of output 41 [2024-11-28 04:44:25,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:25,901 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 42 treesize of output 41 [2024-11-28 04:44:25,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:25,949 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 42 treesize of output 41 [2024-11-28 04:44:26,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:26,002 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 42 treesize of output 41 [2024-11-28 04:44:26,012 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 31 treesize of output 13 [2024-11-28 04:44:26,032 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:44:26,032 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 [2024-11-28 04:44:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:26,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:26,966 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 04:44:26,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-28 04:44:27,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2347 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2354))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2347)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2348)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2349)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2350)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 04:44:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603577263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:27,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:44:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 04:44:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550068268] [2024-11-28 04:44:27,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:27,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:44:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:27,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:44:27,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=929, Unknown=48, NotChecked=64, Total=1190 [2024-11-28 04:44:27,010 INFO L87 Difference]: Start difference. First operand 1517 states and 1766 transitions. Second operand has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:32,919 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 04:44:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:44:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-28 04:44:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:32,922 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 04:44:32,922 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 04:44:32,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=1577, Unknown=48, NotChecked=84, Total=1980 [2024-11-28 04:44:32,923 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1533 mSDsluCounter, 14288 mSDsCounter, 0 mSdLazyCounter, 8956 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 15331 SdHoareTripleChecker+Invalid, 8995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:32,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 15331 Invalid, 8995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 8956 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-28 04:44:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 04:44:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2024-11-28 04:44:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1045 states have (on average 1.6650717703349283) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:44:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1765 transitions. [2024-11-28 04:44:32,972 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1765 transitions. Word has length 100 [2024-11-28 04:44:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:32,972 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1765 transitions. [2024-11-28 04:44:32,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1765 transitions. [2024-11-28 04:44:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 04:44:32,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:32,973 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:32,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:44:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:33,174 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020360, now seen corresponding path program 1 times [2024-11-28 04:44:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986917065] [2024-11-28 04:44:33,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986917065] [2024-11-28 04:44:34,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986917065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149830371] [2024-11-28 04:44:34,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:34,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:34,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:44:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:35,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 04:44:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:35,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:44:35,488 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 8 treesize of output 1 [2024-11-28 04:44:35,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:44:35,499 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 [2024-11-28 04:44:35,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:44:35,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:44:35,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:44:35,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:44:35,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:35,818 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 73 treesize of output 66 [2024-11-28 04:44:35,825 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 13 [2024-11-28 04:44:35,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:35,933 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 73 treesize of output 66 [2024-11-28 04:44:35,940 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 13 [2024-11-28 04:44:36,031 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:36,031 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 73 treesize of output 66 [2024-11-28 04:44:36,036 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 13 [2024-11-28 04:44:36,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:36,148 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 73 treesize of output 66 [2024-11-28 04:44:36,154 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 13 [2024-11-28 04:44:36,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:44:36,269 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 73 treesize of output 66 [2024-11-28 04:44:36,280 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 13 [2024-11-28 04:44:36,301 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 42 treesize of output 18 [2024-11-28 04:44:36,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:44:36,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:44:36,323 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 14 treesize of output 9 [2024-11-28 04:44:36,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:44:36,332 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 [2024-11-28 04:44:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:36,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:37,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2537))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2538) .cse0 v_ArrVal_2540) (select (select (store .cse1 .cse0 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2542))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2543 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2537))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2539))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2538) .cse3 v_ArrVal_2540) .cse4 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse5 .cse4 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 04:44:38,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2537))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2538) .cse2 v_ArrVal_2540) (select (select (store .cse3 .cse2 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2542))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (forall ((v_ArrVal_2543 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2537))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2539))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse6 v_ArrVal_2538) .cse7 v_ArrVal_2540) .cse8 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse9 .cse8 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2024-11-28 04:44:38,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:38,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-28 04:44:39,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2543 Int) (v_ArrVal_2540 (Array Int Int))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2537))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2539))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2538) .cse2 v_ArrVal_2540) .cse3 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse5 .cse3 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2543 Int) (v_ArrVal_2540 (Array Int Int))) (or (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_2535))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2537))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2539))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse9 v_ArrVal_2536) .cse10 v_ArrVal_2538) .cse11 v_ArrVal_2540) .cse12 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse13 .cse12 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_20))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse17 v_prenex_23))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse18 v_prenex_21))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_18) .cse17 v_prenex_22) .cse18 v_prenex_19) .cse19 v_prenex_26) (select (select (store .cse20 .cse19 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_24))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-28 04:44:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149830371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:39,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:44:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-28 04:44:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564396302] [2024-11-28 04:44:39,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:44:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:39,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:44:39,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1007, Unknown=38, NotChecked=204, Total=1406 [2024-11-28 04:44:39,339 INFO L87 Difference]: Start difference. First operand 1516 states and 1765 transitions. Second operand has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:44:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:54,490 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 04:44:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:44:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 04:44:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:54,493 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 04:44:54,493 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 04:44:54,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=271, Invalid=1683, Unknown=38, NotChecked=264, Total=2256 [2024-11-28 04:44:54,495 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1528 mSDsluCounter, 11227 mSDsCounter, 0 mSdLazyCounter, 10366 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 12269 SdHoareTripleChecker+Invalid, 10396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 10366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:54,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 12269 Invalid, 10396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 10366 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-11-28 04:44:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 04:44:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1496. [2024-11-28 04:44:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1027 states have (on average 1.6747809152872444) internal successors, (1720), 1485 states have internal predecessors, (1720), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:44:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1744 transitions. [2024-11-28 04:44:54,514 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1744 transitions. Word has length 100 [2024-11-28 04:44:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:54,515 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1744 transitions. [2024-11-28 04:44:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:44:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1744 transitions. [2024-11-28 04:44:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:44:54,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:54,516 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:54,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 04:44:54,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:54,717 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:44:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536655, now seen corresponding path program 1 times [2024-11-28 04:44:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:54,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479144586] [2024-11-28 04:44:54,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479144586] [2024-11-28 04:44:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479144586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:44:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962920622] [2024-11-28 04:44:55,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:55,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:44:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:55,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:44:55,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:44:55,674 INFO L87 Difference]: Start difference. First operand 1496 states and 1744 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:05,157 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2024-11-28 04:45:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:45:05,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 04:45:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:05,160 INFO L225 Difference]: With dead ends: 1522 [2024-11-28 04:45:05,160 INFO L226 Difference]: Without dead ends: 1522 [2024-11-28 04:45:05,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 04:45:05,161 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 11243 mSDsCounter, 0 mSdLazyCounter, 7106 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 12291 SdHoareTripleChecker+Invalid, 7131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:05,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 12291 Invalid, 7131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7106 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-28 04:45:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-11-28 04:45:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1518. [2024-11-28 04:45:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1048 states have (on average 1.6631679389312977) internal successors, (1743), 1506 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:45:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1768 transitions. [2024-11-28 04:45:05,183 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1768 transitions. Word has length 102 [2024-11-28 04:45:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1768 transitions. [2024-11-28 04:45:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1768 transitions. [2024-11-28 04:45:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 04:45:05,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:05,184 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:05,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 04:45:05,185 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:45:05,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536656, now seen corresponding path program 1 times [2024-11-28 04:45:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863097630] [2024-11-28 04:45:05,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863097630] [2024-11-28 04:45:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863097630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:45:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:45:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:45:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101243671] [2024-11-28 04:45:07,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:45:07,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:45:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:07,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:45:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:45:07,187 INFO L87 Difference]: Start difference. First operand 1518 states and 1768 transitions. Second operand has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:15,365 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 04:45:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:45:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 04:45:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:15,367 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 04:45:15,367 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 04:45:15,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 04:45:15,368 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1550 mSDsluCounter, 6486 mSDsCounter, 0 mSdLazyCounter, 5503 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 7529 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:15,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 7529 Invalid, 5531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5503 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-28 04:45:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 04:45:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1518. [2024-11-28 04:45:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1048 states have (on average 1.6622137404580153) internal successors, (1742), 1506 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:45:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 04:45:15,387 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 102 [2024-11-28 04:45:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:15,387 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 04:45:15,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 04:45:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 04:45:15,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:15,388 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 04:45:15,389 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:45:15,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash -11229309, now seen corresponding path program 1 times [2024-11-28 04:45:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016384339] [2024-11-28 04:45:15,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016384339] [2024-11-28 04:45:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016384339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248385574] [2024-11-28 04:45:16,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:16,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:16,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:45:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:16,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:45:16,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:16,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:45:16,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:45:16,955 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 [2024-11-28 04:45:16,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:45:17,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,049 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 31 treesize of output 32 [2024-11-28 04:45:17,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,129 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 31 treesize of output 32 [2024-11-28 04:45:17,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,217 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 31 treesize of output 32 [2024-11-28 04:45:17,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,310 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 31 treesize of output 32 [2024-11-28 04:45:17,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,406 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 31 treesize of output 32 [2024-11-28 04:45:17,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:17,488 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 42 treesize of output 41 [2024-11-28 04:45:17,566 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 31 treesize of output 13 [2024-11-28 04:45:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:17,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:17,597 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:45:17,597 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 21 treesize of output 20 [2024-11-28 04:45:17,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2914 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem56#1.base|)) is different from false [2024-11-28 04:45:17,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2914 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 04:45:17,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2913)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:45:18,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2911))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2912)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2913)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:45:18,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2910))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2911)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2912)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2913)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 04:45:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248385574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:18,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:45:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-28 04:45:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193206969] [2024-11-28 04:45:18,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:45:18,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:45:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:18,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:45:18,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=610, Unknown=43, NotChecked=280, Total=1056 [2024-11-28 04:45:18,613 INFO L87 Difference]: Start difference. First operand 1518 states and 1767 transitions. Second operand has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:26,971 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 04:45:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:45:26,971 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 04:45:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:26,973 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 04:45:26,973 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 04:45:26,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=229, Invalid=1154, Unknown=43, NotChecked=380, Total=1806 [2024-11-28 04:45:26,974 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 9244 mSDsCounter, 0 mSdLazyCounter, 5965 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 10292 SdHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 5965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:26,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 10292 Invalid, 6012 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 5965 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-28 04:45:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 04:45:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 04:45:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1048 states have (on average 1.661259541984733) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:45:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 04:45:26,994 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 103 [2024-11-28 04:45:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 04:45:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:45:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 04:45:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 04:45:26,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:26,995 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:27,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:45:27,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 04:45:27,196 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:45:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash -11229308, now seen corresponding path program 1 times [2024-11-28 04:45:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94763870] [2024-11-28 04:45:27,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94763870] [2024-11-28 04:45:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94763870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406869549] [2024-11-28 04:45:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:29,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:29,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:45:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 04:45:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:29,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:45:30,067 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 8 treesize of output 1 [2024-11-28 04:45:30,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:45:30,098 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 [2024-11-28 04:45:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:45:30,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:45:30,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:45:30,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:45:30,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:30,839 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 73 treesize of output 66 [2024-11-28 04:45:30,859 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 13 [2024-11-28 04:45:31,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:31,179 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 73 treesize of output 66 [2024-11-28 04:45:31,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:31,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:31,394 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 73 treesize of output 66 [2024-11-28 04:45:31,400 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 13 [2024-11-28 04:45:31,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:31,581 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 73 treesize of output 66 [2024-11-28 04:45:31,589 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 13 [2024-11-28 04:45:31,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:31,792 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 73 treesize of output 66 [2024-11-28 04:45:31,804 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 13 [2024-11-28 04:45:31,995 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 04:45:31,995 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 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 04:45:32,023 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 04:45:32,024 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-28 04:45:32,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:32,168 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 88 treesize of output 79 [2024-11-28 04:45:32,186 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 52 treesize of output 16 [2024-11-28 04:45:32,371 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 44 treesize of output 20 [2024-11-28 04:45:32,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2024-11-28 04:45:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:32,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:34,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3118 Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_ArrVal_3121 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse1 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))) is different from false [2024-11-28 04:45:35,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3118 Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_ArrVal_3121 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3113))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3112) .cse7 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse1 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))))) is different from false [2024-11-28 04:45:35,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3118 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3121 Int) (v_ArrVal_3110 (Array Int Int)) (v_ArrVal_3111 (Array Int Int)) (v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3110)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3113))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3111) .cse6 v_ArrVal_3112) .cse7 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 43 (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))))) is different from false [2024-11-28 04:45:36,350 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:45:36,350 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 13 treesize of output 12 [2024-11-28 04:45:36,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3118 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3121 Int) (v_ArrVal_3110 (Array Int Int)) (v_ArrVal_3111 (Array Int Int)) (v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3126 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3127 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3126)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3110))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3113))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3127) .cse6 v_ArrVal_3111) .cse7 v_ArrVal_3112) .cse8 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (= |c_ULTIMATE.start_main_#t~mem50#1.base| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 04:45:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406869549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:36,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:45:36,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2024-11-28 04:45:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744612368] [2024-11-28 04:45:36,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:45:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 04:45:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:36,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 04:45:36,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1661, Unknown=27, NotChecked=348, Total=2256 [2024-11-28 04:45:36,411 INFO L87 Difference]: Start difference. First operand 1517 states and 1766 transitions. Second operand has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:45:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:58,837 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 04:45:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:45:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 04:45:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:58,839 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 04:45:58,839 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 04:45:58,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=412, Invalid=2769, Unknown=27, NotChecked=452, Total=3660 [2024-11-28 04:45:58,841 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1531 mSDsluCounter, 15447 mSDsCounter, 0 mSdLazyCounter, 14255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 16488 SdHoareTripleChecker+Invalid, 14286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 14255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:58,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 16488 Invalid, 14286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 14255 Invalid, 0 Unknown, 0 Unchecked, 21.0s Time] [2024-11-28 04:45:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 04:45:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1494. [2024-11-28 04:45:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1027 states have (on average 1.6728334956183057) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:45:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2024-11-28 04:45:58,857 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 103 [2024-11-28 04:45:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:58,857 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2024-11-28 04:45:58,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:45:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2024-11-28 04:45:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:45:58,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:58,858 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:58,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:45:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 04:45:59,059 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:45:59,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267602, now seen corresponding path program 1 times [2024-11-28 04:45:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006863310] [2024-11-28 04:45:59,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:46:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006863310] [2024-11-28 04:46:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006863310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:46:00,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:46:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 04:46:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713449632] [2024-11-28 04:46:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:46:00,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:46:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:46:00,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:46:00,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:46:00,329 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:10,238 INFO L93 Difference]: Finished difference Result 1545 states and 1801 transitions. [2024-11-28 04:46:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:46:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 04:46:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:10,241 INFO L225 Difference]: With dead ends: 1545 [2024-11-28 04:46:10,241 INFO L226 Difference]: Without dead ends: 1545 [2024-11-28 04:46:10,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:46:10,241 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1593 mSDsluCounter, 12260 mSDsCounter, 0 mSdLazyCounter, 7762 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 13306 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:10,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 13306 Invalid, 7791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7762 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 04:46:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-28 04:46:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1519. [2024-11-28 04:46:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1051 states have (on average 1.659372026641294) internal successors, (1744), 1507 states have internal predecessors, (1744), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:46:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1769 transitions. [2024-11-28 04:46:10,264 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1769 transitions. Word has length 105 [2024-11-28 04:46:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:10,265 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1769 transitions. [2024-11-28 04:46:10,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1769 transitions. [2024-11-28 04:46:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:46:10,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:10,266 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 04:46:10,266 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:46:10,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267603, now seen corresponding path program 1 times [2024-11-28 04:46:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:46:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834653425] [2024-11-28 04:46:10,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:46:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:46:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834653425] [2024-11-28 04:46:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834653425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:46:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:46:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:46:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872949722] [2024-11-28 04:46:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:46:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:46:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:46:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:46:11,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:46:11,643 INFO L87 Difference]: Start difference. First operand 1519 states and 1769 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:20,432 INFO L93 Difference]: Finished difference Result 1544 states and 1800 transitions. [2024-11-28 04:46:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:46:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 04:46:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:20,435 INFO L225 Difference]: With dead ends: 1544 [2024-11-28 04:46:20,435 INFO L226 Difference]: Without dead ends: 1544 [2024-11-28 04:46:20,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:46:20,435 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1612 mSDsluCounter, 9783 mSDsCounter, 0 mSdLazyCounter, 7053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 10825 SdHoareTripleChecker+Invalid, 7083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:20,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 10825 Invalid, 7083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 7053 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-28 04:46:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-28 04:46:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1519. [2024-11-28 04:46:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1051 states have (on average 1.6584205518553758) internal successors, (1743), 1507 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:46:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2024-11-28 04:46:20,454 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 105 [2024-11-28 04:46:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:20,455 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2024-11-28 04:46:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2024-11-28 04:46:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 04:46:20,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:20,456 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 04:46:20,456 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:46:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 475770014, now seen corresponding path program 1 times [2024-11-28 04:46:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:46:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707841679] [2024-11-28 04:46:20,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:46:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:46:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:46:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707841679] [2024-11-28 04:46:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707841679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:46:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:46:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 04:46:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475974868] [2024-11-28 04:46:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:46:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:46:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:46:23,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:46:23,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:46:23,316 INFO L87 Difference]: Start difference. First operand 1519 states and 1768 transitions. Second operand has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:31,686 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2024-11-28 04:46:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:46:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-28 04:46:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:31,688 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 04:46:31,689 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 04:46:31,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:46:31,689 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 4625 mSDsluCounter, 10227 mSDsCounter, 0 mSdLazyCounter, 6447 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4634 SdHoareTripleChecker+Valid, 11281 SdHoareTripleChecker+Invalid, 6492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 6447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:31,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4634 Valid, 11281 Invalid, 6492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 6447 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-28 04:46:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 04:46:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2024-11-28 04:46:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1051 states have (on average 1.6574690770694576) internal successors, (1742), 1506 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 04:46:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 04:46:31,699 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 106 [2024-11-28 04:46:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 04:46:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:46:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 04:46:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 04:46:31,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:31,700 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:31,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 04:46:31,700 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:46:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash 475770015, now seen corresponding path program 1 times [2024-11-28 04:46:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:46:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838443528] [2024-11-28 04:46:31,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:46:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:46:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838443528] [2024-11-28 04:46:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838443528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:46:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692320540] [2024-11-28 04:46:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:46:33,136 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:46:33,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:46:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:33,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 04:46:33,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:46:33,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:46:33,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:46:33,731 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 [2024-11-28 04:46:33,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:46:33,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:46:33,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:33,878 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 51 treesize of output 48 [2024-11-28 04:46:33,882 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 13 [2024-11-28 04:46:33,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:33,971 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 51 treesize of output 48 [2024-11-28 04:46:33,978 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 13 [2024-11-28 04:46:34,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:34,099 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 51 treesize of output 48 [2024-11-28 04:46:34,104 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 13 [2024-11-28 04:46:34,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:34,226 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 51 treesize of output 48 [2024-11-28 04:46:34,232 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 13 [2024-11-28 04:46:34,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:34,352 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 51 treesize of output 48 [2024-11-28 04:46:34,357 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 13 [2024-11-28 04:46:34,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:34,503 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 62 treesize of output 57 [2024-11-28 04:46:34,510 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 13 [2024-11-28 04:46:34,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:46:34,678 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 62 treesize of output 57 [2024-11-28 04:46:34,688 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 13 [2024-11-28 04:46:34,708 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 31 treesize of output 13 [2024-11-28 04:46:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:46:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:34,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:46:34,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3624 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:46:34,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:34,965 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 80 treesize of output 84 [2024-11-28 04:46:35,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3622) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3621))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:46:35,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3619) .cse0 v_ArrVal_3622) (select (select (store .cse1 .cse0 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3624))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3621))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse5)))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3619) .cse6 v_prenex_40) (select (select (store .cse7 .cse6 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:46:35,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3619) .cse5 v_prenex_40) (select (select (store .cse6 .cse5 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3619) .cse7 v_ArrVal_3622) (select (select (store .cse8 .cse7 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))))) is different from false [2024-11-28 04:46:35,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3620))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3617) .cse0 v_ArrVal_3619) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3620))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3617) .cse5 v_ArrVal_3619) .cse6 v_ArrVal_3622) (select (select (store .cse7 .cse6 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3624))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3620)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3621))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 04:46:35,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3620)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3620))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3617) .cse6 v_ArrVal_3619) .cse7 v_ArrVal_3622) (select (select (store .cse8 .cse7 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3620))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3617) .cse10 v_ArrVal_3619) .cse11 v_prenex_40) (select (select (store .cse12 .cse11 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:46:36,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3618))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3620))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3615) .cse0 v_ArrVal_3617) .cse1 v_ArrVal_3619) .cse2 v_ArrVal_3622) (select (select (store .cse3 .cse2 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3624))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3618))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3620))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3615) .cse7 v_ArrVal_3617) .cse8 v_ArrVal_3619) .cse9 v_prenex_40) (select (select (store .cse10 .cse9 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3618)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3620)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_3621))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse15)))))) is different from false [2024-11-28 04:46:40,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3618))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3620))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3615) .cse1 v_ArrVal_3617) .cse2 v_ArrVal_3619) .cse3 v_ArrVal_3622) (select (select (store .cse4 .cse3 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3624))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3618))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3620))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3615) .cse8 v_ArrVal_3617) .cse9 v_ArrVal_3619) .cse10 v_prenex_40) (select (select (store .cse11 .cse10 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3618)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3620)))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse14 (select (select (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3621))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-28 04:46:45,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3616)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3618)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3620)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3621))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3616))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3618))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3620))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3614) .cse7 v_ArrVal_3615) .cse8 v_ArrVal_3617) .cse9 v_ArrVal_3619) .cse10 v_ArrVal_3622) (select (select (store .cse11 .cse10 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3624))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3616))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3618))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3620))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3614) .cse15 v_ArrVal_3615) .cse16 v_ArrVal_3617) .cse17 v_ArrVal_3619) .cse18 v_prenex_40) (select (select (store .cse19 .cse18 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:46:49,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 04:46:49,139 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 04:46:49,141 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 04:46:49,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:46:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-28 04:46:49,343 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-28 04:46:49,356 INFO L158 Benchmark]: Toolchain (without parser) took 266922.46ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 112.3MB in the beginning and 455.4MB in the end (delta: -343.1MB). Peak memory consumption was 235.1MB. Max. memory is 16.1GB. [2024-11-28 04:46:49,357 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:46:49,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1064.51ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 74.9MB in the end (delta: 37.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 04:46:49,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.73ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 63.8MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:46:49,359 INFO L158 Benchmark]: Boogie Preprocessor took 307.51ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 86.8MB in the end (delta: -23.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-28 04:46:49,360 INFO L158 Benchmark]: RCFGBuilder took 4201.68ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 86.8MB in the beginning and 152.5MB in the end (delta: -65.7MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. [2024-11-28 04:46:49,360 INFO L158 Benchmark]: TraceAbstraction took 261213.93ms. Allocated memory was 427.8MB in the beginning and 721.4MB in the end (delta: 293.6MB). Free memory was 151.7MB in the beginning and 455.4MB in the end (delta: -303.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:46:49,361 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.52ms. Allocated memory is still 142.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1064.51ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 74.9MB in the end (delta: 37.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.73ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 63.8MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 307.51ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 86.8MB in the end (delta: -23.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * RCFGBuilder took 4201.68ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 86.8MB in the beginning and 152.5MB in the end (delta: -65.7MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. * TraceAbstraction took 261213.93ms. Allocated memory was 427.8MB in the beginning and 721.4MB in the end (delta: 293.6MB). Free memory was 151.7MB in the beginning and 455.4MB in the end (delta: -303.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:46:51,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:46:52,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 04:46:52,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:46:52,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:46:52,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:46:52,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:46:52,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:46:52,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:46:52,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:46:52,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:46:52,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:46:52,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:46:52,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:46:52,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:46:52,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:46:52,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:46:52,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:46:52,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:46:52,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:46:52,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:46:52,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:46:52,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:46:52,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:46:52,141 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:46:52,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:46:52,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:46:52,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:46:52,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:46:52,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:46:52,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-11-28 04:46:52,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:46:52,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:46:52,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:46:52,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:46:52,517 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:46:52,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-28 04:46:55,535 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/5adfe60c7/ef062770dcd14000b41826fabbcd6685/FLAGe6f868c33 [2024-11-28 04:46:55,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:46:55,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-28 04:46:55,884 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/5adfe60c7/ef062770dcd14000b41826fabbcd6685/FLAGe6f868c33 [2024-11-28 04:46:55,907 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/data/5adfe60c7/ef062770dcd14000b41826fabbcd6685 [2024-11-28 04:46:55,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:46:55,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:46:55,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:46:55,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:46:55,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:46:55,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:46:55" (1/1) ... [2024-11-28 04:46:55,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dc4d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:55, skipping insertion in model container [2024-11-28 04:46:55,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:46:55" (1/1) ... [2024-11-28 04:46:55,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:46:56,435 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,472 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,477 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,482 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,490 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,542 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,545 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,552 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,564 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,597 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,598 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,601 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,601 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:46:56,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:46:56,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:46:56,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:46:56,866 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:46:56,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56 WrapperNode [2024-11-28 04:46:56,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:46:56,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:46:56,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:46:56,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:46:56,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:56,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,046 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1399 [2024-11-28 04:46:57,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:46:57,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:46:57,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:46:57,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:46:57,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,189 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-11-28 04:46:57,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:46:57,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:46:57,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:46:57,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:46:57,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (1/1) ... [2024-11-28 04:46:57,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:46:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:46:57,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:46:57,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:46:57,378 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 04:46:57,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 04:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 04:46:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 04:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 04:46:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 04:46:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 04:46:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 04:46:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:46:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:46:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 04:46:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 04:46:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 04:46:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 04:46:57,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 04:46:57,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:46:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 04:46:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:46:57,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:46:57,675 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:46:57,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:46:57,704 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:46:57,753 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:46:57,787 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:47:04,125 INFO L? ?]: Removed 1482 outVars from TransFormulas that were not future-live. [2024-11-28 04:47:04,125 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:47:04,188 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:47:04,192 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2024-11-28 04:47:04,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:47:04 BoogieIcfgContainer [2024-11-28 04:47:04,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:47:04,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:47:04,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:47:04,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:47:04,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:46:55" (1/3) ... [2024-11-28 04:47:04,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338cee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:47:04, skipping insertion in model container [2024-11-28 04:47:04,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:46:56" (2/3) ... [2024-11-28 04:47:04,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338cee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:47:04, skipping insertion in model container [2024-11-28 04:47:04,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:47:04" (3/3) ... [2024-11-28 04:47:04,204 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-11-28 04:47:04,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:47:04,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 6 procedures, 1454 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-28 04:47:04,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:47:04,290 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@a4a4b74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:47:04,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-28 04:47:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 1444 states, 721 states have (on average 2.2094313453536754) internal successors, (1593), 1434 states have internal predecessors, (1593), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 04:47:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:47:04,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:04,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:47:04,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:04,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-28 04:47:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685546846] [2024-11-28 04:47:04,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:04,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:04,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:47:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:04,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:47:04,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:04,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:04,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685546846] [2024-11-28 04:47:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685546846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:04,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:47:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326552647] [2024-11-28 04:47:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:04,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:47:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:04,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:47:04,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:47:04,625 INFO L87 Difference]: Start difference. First operand has 1444 states, 721 states have (on average 2.2094313453536754) internal successors, (1593), 1434 states have internal predecessors, (1593), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:04,714 INFO L93 Difference]: Finished difference Result 1424 states and 1506 transitions. [2024-11-28 04:47:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:47:04,716 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:47:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:04,734 INFO L225 Difference]: With dead ends: 1424 [2024-11-28 04:47:04,734 INFO L226 Difference]: Without dead ends: 1422 [2024-11-28 04:47:04,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:47:04,740 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:04,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:47:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-28 04:47:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2024-11-28 04:47:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 711 states have (on average 2.0815752461322083) internal successors, (1480), 1412 states have internal predecessors, (1480), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:47:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1504 transitions. [2024-11-28 04:47:04,851 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1504 transitions. Word has length 6 [2024-11-28 04:47:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 1504 transitions. [2024-11-28 04:47:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1504 transitions. [2024-11-28 04:47:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:47:04,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:04,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:47:04,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:47:05,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:05,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 04:47:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480854376] [2024-11-28 04:47:05,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:05,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:05,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:05,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:05,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:47:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:05,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:47:05,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:05,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:47:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:05,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:05,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480854376] [2024-11-28 04:47:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480854376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:47:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826066555] [2024-11-28 04:47:05,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:05,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:47:05,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:05,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:47:05,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:05,297 INFO L87 Difference]: Start difference. First operand 1422 states and 1504 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:08,341 INFO L93 Difference]: Finished difference Result 1559 states and 1673 transitions. [2024-11-28 04:47:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:47:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:47:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:08,348 INFO L225 Difference]: With dead ends: 1559 [2024-11-28 04:47:08,348 INFO L226 Difference]: Without dead ends: 1559 [2024-11-28 04:47:08,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:08,349 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1265 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:08,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1151 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 04:47:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-28 04:47:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1330. [2024-11-28 04:47:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 711 states have (on average 1.9521800281293953) internal successors, (1388), 1320 states have internal predecessors, (1388), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:47:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1412 transitions. [2024-11-28 04:47:08,390 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1412 transitions. Word has length 6 [2024-11-28 04:47:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1412 transitions. [2024-11-28 04:47:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1412 transitions. [2024-11-28 04:47:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:47:08,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:08,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:47:08,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:47:08,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:08,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 04:47:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112574654] [2024-11-28 04:47:08,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:08,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:08,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:08,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:08,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:47:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:08,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:47:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:08,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:08,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112574654] [2024-11-28 04:47:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112574654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:47:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618692529] [2024-11-28 04:47:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:47:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:08,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:47:08,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:08,787 INFO L87 Difference]: Start difference. First operand 1330 states and 1412 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:12,919 INFO L93 Difference]: Finished difference Result 1879 states and 2011 transitions. [2024-11-28 04:47:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:47:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:47:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:12,927 INFO L225 Difference]: With dead ends: 1879 [2024-11-28 04:47:12,927 INFO L226 Difference]: Without dead ends: 1879 [2024-11-28 04:47:12,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:12,928 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 771 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:12,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1941 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 04:47:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-28 04:47:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1497. [2024-11-28 04:47:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 888 states have (on average 1.9234234234234233) internal successors, (1708), 1487 states have internal predecessors, (1708), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:47:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1732 transitions. [2024-11-28 04:47:12,966 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1732 transitions. Word has length 6 [2024-11-28 04:47:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1732 transitions. [2024-11-28 04:47:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1732 transitions. [2024-11-28 04:47:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:47:12,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:12,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:47:12,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:13,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422772, now seen corresponding path program 1 times [2024-11-28 04:47:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646999402] [2024-11-28 04:47:13,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:13,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:13,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:13,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:47:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:13,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:47:13,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:13,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:47:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:13,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:13,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646999402] [2024-11-28 04:47:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646999402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:47:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647261927] [2024-11-28 04:47:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:47:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:47:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:13,341 INFO L87 Difference]: Start difference. First operand 1497 states and 1732 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:16,772 INFO L93 Difference]: Finished difference Result 2627 states and 3066 transitions. [2024-11-28 04:47:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:47:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:47:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:16,782 INFO L225 Difference]: With dead ends: 2627 [2024-11-28 04:47:16,782 INFO L226 Difference]: Without dead ends: 2627 [2024-11-28 04:47:16,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:16,783 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1217 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:16,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1475 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 04:47:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-11-28 04:47:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2026. [2024-11-28 04:47:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1418 states have (on average 1.9019746121297603) internal successors, (2697), 2012 states have internal predecessors, (2697), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2729 transitions. [2024-11-28 04:47:16,839 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2729 transitions. Word has length 6 [2024-11-28 04:47:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 2026 states and 2729 transitions. [2024-11-28 04:47:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2729 transitions. [2024-11-28 04:47:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:47:16,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:16,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:47:16,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:47:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:17,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422773, now seen corresponding path program 1 times [2024-11-28 04:47:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467255599] [2024-11-28 04:47:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:17,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:17,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:47:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:17,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 04:47:17,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:17,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:17,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467255599] [2024-11-28 04:47:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467255599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:47:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102901402] [2024-11-28 04:47:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:47:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:17,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:47:17,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:17,194 INFO L87 Difference]: Start difference. First operand 2026 states and 2729 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:17,304 INFO L93 Difference]: Finished difference Result 3684 states and 4781 transitions. [2024-11-28 04:47:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:47:17,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:47:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:17,322 INFO L225 Difference]: With dead ends: 3684 [2024-11-28 04:47:17,322 INFO L226 Difference]: Without dead ends: 3684 [2024-11-28 04:47:17,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:17,323 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 1357 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:17,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 2785 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:47:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2024-11-28 04:47:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2028. [2024-11-28 04:47:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1420 states have (on average 1.9) internal successors, (2698), 2014 states have internal predecessors, (2698), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2730 transitions. [2024-11-28 04:47:17,383 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2730 transitions. Word has length 6 [2024-11-28 04:47:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2730 transitions. [2024-11-28 04:47:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2730 transitions. [2024-11-28 04:47:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:47:17,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:17,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:17,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:47:17,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:17,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 04:47:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:17,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162063837] [2024-11-28 04:47:17,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:17,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:17,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:17,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:17,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:47:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:17,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:47:17,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:47:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:17,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:17,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162063837] [2024-11-28 04:47:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162063837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:17,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:47:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175052072] [2024-11-28 04:47:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:47:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:17,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:47:17,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:47:17,807 INFO L87 Difference]: Start difference. First operand 2028 states and 2730 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:21,301 INFO L93 Difference]: Finished difference Result 2014 states and 2693 transitions. [2024-11-28 04:47:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:47:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:47:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:21,309 INFO L225 Difference]: With dead ends: 2014 [2024-11-28 04:47:21,309 INFO L226 Difference]: Without dead ends: 2014 [2024-11-28 04:47:21,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:21,311 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1315 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:21,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1307 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 04:47:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-28 04:47:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2005. [2024-11-28 04:47:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1420 states have (on average 1.8676056338028169) internal successors, (2652), 1991 states have internal predecessors, (2652), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2684 transitions. [2024-11-28 04:47:21,361 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2684 transitions. Word has length 12 [2024-11-28 04:47:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:21,362 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2684 transitions. [2024-11-28 04:47:21,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2684 transitions. [2024-11-28 04:47:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:47:21,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:21,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:21,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:21,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 04:47:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995004228] [2024-11-28 04:47:21,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:21,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:21,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:47:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:21,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:47:21,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:21,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:21,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:21,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995004228] [2024-11-28 04:47:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995004228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:47:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229969060] [2024-11-28 04:47:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:47:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:21,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:47:21,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:47:21,863 INFO L87 Difference]: Start difference. First operand 2005 states and 2684 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:26,982 INFO L93 Difference]: Finished difference Result 2533 states and 3135 transitions. [2024-11-28 04:47:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:47:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:47:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:26,989 INFO L225 Difference]: With dead ends: 2533 [2024-11-28 04:47:26,990 INFO L226 Difference]: Without dead ends: 2533 [2024-11-28 04:47:26,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:26,990 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 895 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:26,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 2328 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 04:47:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2024-11-28 04:47:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2121. [2024-11-28 04:47:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1536 states have (on average 1.8177083333333333) internal successors, (2792), 2107 states have internal predecessors, (2792), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2824 transitions. [2024-11-28 04:47:27,036 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2824 transitions. Word has length 12 [2024-11-28 04:47:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2824 transitions. [2024-11-28 04:47:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2824 transitions. [2024-11-28 04:47:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 04:47:27,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:27,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:27,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:47:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:27,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1395848739, now seen corresponding path program 1 times [2024-11-28 04:47:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211549974] [2024-11-28 04:47:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:27,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:27,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:47:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:27,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:47:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:27,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:27,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:47:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:28,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211549974] [2024-11-28 04:47:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211549974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:47:28,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:47:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 04:47:28,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562111506] [2024-11-28 04:47:28,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:47:28,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:47:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:28,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:47:28,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:47:28,248 INFO L87 Difference]: Start difference. First operand 2121 states and 2824 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:40,246 INFO L93 Difference]: Finished difference Result 2947 states and 3711 transitions. [2024-11-28 04:47:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:47:40,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 04:47:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:40,255 INFO L225 Difference]: With dead ends: 2947 [2024-11-28 04:47:40,255 INFO L226 Difference]: Without dead ends: 2947 [2024-11-28 04:47:40,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:47:40,256 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 2753 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:40,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 3111 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-28 04:47:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2024-11-28 04:47:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2287. [2024-11-28 04:47:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1702 states have (on average 1.7779083431257345) internal successors, (3026), 2273 states have internal predecessors, (3026), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3058 transitions. [2024-11-28 04:47:40,307 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3058 transitions. Word has length 31 [2024-11-28 04:47:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 3058 transitions. [2024-11-28 04:47:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3058 transitions. [2024-11-28 04:47:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 04:47:40,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:40,311 INFO L218 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, 1, 1, 1] [2024-11-28 04:47:40,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:47:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:40,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1652938312, now seen corresponding path program 1 times [2024-11-28 04:47:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297288175] [2024-11-28 04:47:40,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:40,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:40,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:40,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:47:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:40,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:47:40,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:40,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:40,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297288175] [2024-11-28 04:47:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297288175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:47:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088549892] [2024-11-28 04:47:40,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:40,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:47:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:40,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:47:40,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:40,978 INFO L87 Difference]: Start difference. First operand 2287 states and 3058 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:41,071 INFO L93 Difference]: Finished difference Result 2531 states and 3360 transitions. [2024-11-28 04:47:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:47:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-28 04:47:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:41,077 INFO L225 Difference]: With dead ends: 2531 [2024-11-28 04:47:41,077 INFO L226 Difference]: Without dead ends: 2531 [2024-11-28 04:47:41,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:47:41,078 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 75 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2727 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:47:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-11-28 04:47:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2508. [2024-11-28 04:47:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 1923 states have (on average 1.7306292251690067) internal successors, (3328), 2494 states have internal predecessors, (3328), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3360 transitions. [2024-11-28 04:47:41,119 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3360 transitions. Word has length 44 [2024-11-28 04:47:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:41,120 INFO L471 AbstractCegarLoop]: Abstraction has 2508 states and 3360 transitions. [2024-11-28 04:47:41,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3360 transitions. [2024-11-28 04:47:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:47:41,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:41,121 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:41,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:47:41,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:41,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:41,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -994558784, now seen corresponding path program 1 times [2024-11-28 04:47:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082753122] [2024-11-28 04:47:41,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:41,325 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:41,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:47:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:41,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:47:41,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:41,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:41,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082753122] [2024-11-28 04:47:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082753122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:47:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459710526] [2024-11-28 04:47:41,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:47:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:41,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:47:41,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:47:41,611 INFO L87 Difference]: Start difference. First operand 2508 states and 3360 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:41,719 INFO L93 Difference]: Finished difference Result 2047 states and 2700 transitions. [2024-11-28 04:47:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:47:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 04:47:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:41,757 INFO L225 Difference]: With dead ends: 2047 [2024-11-28 04:47:41,758 INFO L226 Difference]: Without dead ends: 2047 [2024-11-28 04:47:41,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:41,759 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 56 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:41,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3875 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:47:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-11-28 04:47:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2044. [2024-11-28 04:47:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1482 states have (on average 1.7982456140350878) internal successors, (2665), 2030 states have internal predecessors, (2665), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2697 transitions. [2024-11-28 04:47:41,790 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2697 transitions. Word has length 47 [2024-11-28 04:47:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:41,791 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2697 transitions. [2024-11-28 04:47:41,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2697 transitions. [2024-11-28 04:47:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:47:41,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:41,795 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:41,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:41,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:41,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1215894668, now seen corresponding path program 1 times [2024-11-28 04:47:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185076157] [2024-11-28 04:47:41,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:42,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:42,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:47:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:42,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:47:42,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:42,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:47:42,860 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 14 treesize of output 9 [2024-11-28 04:47:42,881 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:47:42,881 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 13 treesize of output 13 [2024-11-28 04:47:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:42,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:42,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185076157] [2024-11-28 04:47:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185076157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:47:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045990472] [2024-11-28 04:47:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:47:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:42,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:47:42,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:42,893 INFO L87 Difference]: Start difference. First operand 2044 states and 2697 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:46,997 INFO L93 Difference]: Finished difference Result 1960 states and 2577 transitions. [2024-11-28 04:47:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:47:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-28 04:47:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:47,004 INFO L225 Difference]: With dead ends: 1960 [2024-11-28 04:47:47,004 INFO L226 Difference]: Without dead ends: 1960 [2024-11-28 04:47:47,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:47:47,005 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1207 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 826 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 04:47:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2024-11-28 04:47:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1610. [2024-11-28 04:47:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1132 states have (on average 1.6687279151943464) internal successors, (1889), 1596 states have internal predecessors, (1889), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1921 transitions. [2024-11-28 04:47:47,032 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1921 transitions. Word has length 55 [2024-11-28 04:47:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:47,032 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 1921 transitions. [2024-11-28 04:47:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1921 transitions. [2024-11-28 04:47:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:47:47,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:47,034 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:47,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:47,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash -474771177, now seen corresponding path program 1 times [2024-11-28 04:47:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555701216] [2024-11-28 04:47:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:47,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:47,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:47,238 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:47,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:47:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:47,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:47:47,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:47:47,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:47:47,529 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 11 [2024-11-28 04:47:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:47,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:47,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555701216] [2024-11-28 04:47:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555701216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:47:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987660357] [2024-11-28 04:47:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:47,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:47:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:47,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:47:47,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:47,544 INFO L87 Difference]: Start difference. First operand 1610 states and 1921 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:51,334 INFO L93 Difference]: Finished difference Result 1609 states and 1919 transitions. [2024-11-28 04:47:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:47:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 04:47:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:51,340 INFO L225 Difference]: With dead ends: 1609 [2024-11-28 04:47:51,341 INFO L226 Difference]: Without dead ends: 1609 [2024-11-28 04:47:51,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:47:51,342 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 2 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3240 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 04:47:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-11-28 04:47:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2024-11-28 04:47:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1132 states have (on average 1.6669611307420495) internal successors, (1887), 1595 states have internal predecessors, (1887), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1919 transitions. [2024-11-28 04:47:51,364 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1919 transitions. Word has length 60 [2024-11-28 04:47:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:51,364 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 1919 transitions. [2024-11-28 04:47:51,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1919 transitions. [2024-11-28 04:47:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:47:51,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:51,365 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:51,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:51,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -474771176, now seen corresponding path program 1 times [2024-11-28 04:47:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:51,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37714114] [2024-11-28 04:47:51,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:51,571 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:51,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:47:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:51,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 04:47:51,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:51,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:51,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:47:51,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:47:52,016 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 21 treesize of output 9 [2024-11-28 04:47:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:52,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:52,040 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37714114] [2024-11-28 04:47:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37714114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:52,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:47:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461840766] [2024-11-28 04:47:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:47:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:52,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:47:52,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:47:52,042 INFO L87 Difference]: Start difference. First operand 1609 states and 1919 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:56,427 INFO L93 Difference]: Finished difference Result 1608 states and 1917 transitions. [2024-11-28 04:47:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:47:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 04:47:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:56,432 INFO L225 Difference]: With dead ends: 1608 [2024-11-28 04:47:56,432 INFO L226 Difference]: Without dead ends: 1608 [2024-11-28 04:47:56,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:47:56,433 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 1 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:56,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3259 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 04:47:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-28 04:47:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-28 04:47:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1130 states have (on average 1.668141592920354) internal successors, (1885), 1594 states have internal predecessors, (1885), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:47:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1917 transitions. [2024-11-28 04:47:56,449 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1917 transitions. Word has length 60 [2024-11-28 04:47:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:56,449 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 1917 transitions. [2024-11-28 04:47:56,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:47:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1917 transitions. [2024-11-28 04:47:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:47:56,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:56,450 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:56,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 04:47:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:56,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:47:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2106397886, now seen corresponding path program 1 times [2024-11-28 04:47:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:47:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574469615] [2024-11-28 04:47:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:56,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:56,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:47:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:56,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:47:56,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:56,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:47:57,017 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 11 [2024-11-28 04:47:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:47:57,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:47:57,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:47:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574469615] [2024-11-28 04:47:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574469615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:47:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:47:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:47:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093081662] [2024-11-28 04:47:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:47:57,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:47:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:47:57,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:47:57,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:47:57,038 INFO L87 Difference]: Start difference. First operand 1608 states and 1917 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:48:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:01,645 INFO L93 Difference]: Finished difference Result 1626 states and 1948 transitions. [2024-11-28 04:48:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:48:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 04:48:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:01,650 INFO L225 Difference]: With dead ends: 1626 [2024-11-28 04:48:01,650 INFO L226 Difference]: Without dead ends: 1626 [2024-11-28 04:48:01,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:48:01,651 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 13 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:01,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4535 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 04:48:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-28 04:48:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1617. [2024-11-28 04:48:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1138 states have (on average 1.6660808435852372) internal successors, (1896), 1601 states have internal predecessors, (1896), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-28 04:48:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1938 transitions. [2024-11-28 04:48:01,679 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1938 transitions. Word has length 68 [2024-11-28 04:48:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:01,679 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 1938 transitions. [2024-11-28 04:48:01,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:48:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1938 transitions. [2024-11-28 04:48:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:48:01,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:01,680 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:01,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:48:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:01,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:48:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2106397887, now seen corresponding path program 1 times [2024-11-28 04:48:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:01,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815636659] [2024-11-28 04:48:01,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:48:01,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:01,888 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:01,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:48:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:48:02,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:48:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:02,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:48:02,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815636659] [2024-11-28 04:48:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815636659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:48:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:48:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:48:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298542689] [2024-11-28 04:48:02,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:48:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:48:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:48:02,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:48:02,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:48:02,188 INFO L87 Difference]: Start difference. First operand 1617 states and 1938 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:48:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:02,277 INFO L93 Difference]: Finished difference Result 1611 states and 1922 transitions. [2024-11-28 04:48:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:48:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 04:48:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:02,288 INFO L225 Difference]: With dead ends: 1611 [2024-11-28 04:48:02,292 INFO L226 Difference]: Without dead ends: 1611 [2024-11-28 04:48:02,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:48:02,293 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 0 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:02,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3718 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:48:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-11-28 04:48:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2024-11-28 04:48:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1132 states have (on average 1.667844522968198) internal successors, (1888), 1597 states have internal predecessors, (1888), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:48:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1922 transitions. [2024-11-28 04:48:02,332 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1922 transitions. Word has length 68 [2024-11-28 04:48:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:02,332 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 1922 transitions. [2024-11-28 04:48:02,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:48:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1922 transitions. [2024-11-28 04:48:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:48:02,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:02,333 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:02,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:48:02,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:02,537 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:48:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1319466674, now seen corresponding path program 1 times [2024-11-28 04:48:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277882031] [2024-11-28 04:48:02,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:48:02,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:02,542 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:02,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:48:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:48:02,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:48:02,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:02,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:02,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277882031] [2024-11-28 04:48:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277882031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:48:02,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:48:02,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 04:48:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865112014] [2024-11-28 04:48:02,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:48:02,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:48:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:48:02,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:48:02,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:48:02,914 INFO L87 Difference]: Start difference. First operand 1611 states and 1922 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:48:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:03,216 INFO L93 Difference]: Finished difference Result 1623 states and 1940 transitions. [2024-11-28 04:48:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:48:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-28 04:48:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:03,221 INFO L225 Difference]: With dead ends: 1623 [2024-11-28 04:48:03,221 INFO L226 Difference]: Without dead ends: 1623 [2024-11-28 04:48:03,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:48:03,222 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 7 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:03,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3719 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:48:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-11-28 04:48:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1621. [2024-11-28 04:48:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1141 states have (on average 1.6678352322524101) internal successors, (1903), 1606 states have internal predecessors, (1903), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:48:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1937 transitions. [2024-11-28 04:48:03,246 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1937 transitions. Word has length 69 [2024-11-28 04:48:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:03,246 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 1937 transitions. [2024-11-28 04:48:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:48:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1937 transitions. [2024-11-28 04:48:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:48:03,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:03,247 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:03,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:48:03,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:03,448 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:48:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash 831517118, now seen corresponding path program 2 times [2024-11-28 04:48:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533059142] [2024-11-28 04:48:03,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:48:03,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:03,453 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:03,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:48:12,597 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:48:12,597 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:48:12,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 04:48:12,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:12,758 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:48:12,759 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 13 treesize of output 13 [2024-11-28 04:48:12,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:48:13,088 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:48:13,088 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 44 treesize of output 43 [2024-11-28 04:48:13,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:48:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:48:13,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:13,352 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 04:48:13,356 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 25 treesize of output 24 [2024-11-28 04:48:13,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-28 04:48:13,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533059142] [2024-11-28 04:48:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533059142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:48:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1523354395] [2024-11-28 04:48:13,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:48:13,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:48:13,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:48:13,383 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:48:13,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-28 04:48:14,648 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:48:14,648 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:48:14,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:48:14,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:14,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:15,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1523354395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:48:15,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:48:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 04:48:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394640695] [2024-11-28 04:48:15,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:48:15,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:48:15,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:48:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:48:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-28 04:48:15,459 INFO L87 Difference]: Start difference. First operand 1621 states and 1937 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:48:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:37,934 INFO L93 Difference]: Finished difference Result 1637 states and 1959 transitions. [2024-11-28 04:48:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 04:48:37,935 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-28 04:48:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:37,938 INFO L225 Difference]: With dead ends: 1637 [2024-11-28 04:48:37,938 INFO L226 Difference]: Without dead ends: 1631 [2024-11-28 04:48:37,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=392, Invalid=2161, Unknown=1, NotChecked=98, Total=2652 [2024-11-28 04:48:37,939 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 1222 mSDsluCounter, 10275 mSDsCounter, 0 mSdLazyCounter, 10500 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 10935 SdHoareTripleChecker+Invalid, 10537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 10500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:37,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 10935 Invalid, 10537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 10500 Invalid, 0 Unknown, 0 Unchecked, 21.0s Time] [2024-11-28 04:48:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-11-28 04:48:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1629. [2024-11-28 04:48:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1150 states have (on average 1.662608695652174) internal successors, (1912), 1614 states have internal predecessors, (1912), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:48:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1946 transitions. [2024-11-28 04:48:37,968 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1946 transitions. Word has length 72 [2024-11-28 04:48:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:37,969 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 1946 transitions. [2024-11-28 04:48:37,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:48:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1946 transitions. [2024-11-28 04:48:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 04:48:37,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:37,970 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:37,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-28 04:48:38,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 04:48:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:38,371 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:48:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1258425663, now seen corresponding path program 1 times [2024-11-28 04:48:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601605938] [2024-11-28 04:48:38,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:48:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:38,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:38,374 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:38,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:48:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:48:38,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 04:48:38,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:38,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:39,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601605938] [2024-11-28 04:48:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601605938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:48:39,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:48:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 04:48:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719517924] [2024-11-28 04:48:39,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:48:39,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:48:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:48:39,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:48:39,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:48:39,728 INFO L87 Difference]: Start difference. First operand 1629 states and 1946 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:48:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:43,163 INFO L93 Difference]: Finished difference Result 1653 states and 1985 transitions. [2024-11-28 04:48:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 04:48:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-28 04:48:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:43,169 INFO L225 Difference]: With dead ends: 1653 [2024-11-28 04:48:43,169 INFO L226 Difference]: Without dead ends: 1647 [2024-11-28 04:48:43,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 04:48:43,170 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 17 mSDsluCounter, 13607 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14848 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:43,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14848 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:48:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-28 04:48:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-11-28 04:48:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1168 states have (on average 1.6566780821917808) internal successors, (1935), 1632 states have internal predecessors, (1935), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:48:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 1969 transitions. [2024-11-28 04:48:43,200 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 1969 transitions. Word has length 78 [2024-11-28 04:48:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 1969 transitions. [2024-11-28 04:48:43,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:48:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1969 transitions. [2024-11-28 04:48:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 04:48:43,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:43,202 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:43,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 04:48:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:43,402 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:48:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1408656447, now seen corresponding path program 2 times [2024-11-28 04:48:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447417961] [2024-11-28 04:48:43,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:48:43,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:43,406 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:43,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:48:54,721 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:48:54,721 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:48:54,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 04:48:54,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:54,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:48:54,903 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:48:54,903 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 13 treesize of output 13 [2024-11-28 04:48:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:48:54,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:48:55,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:48:55,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:48:55,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:48:55,638 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 62 treesize of output 57 [2024-11-28 04:48:55,649 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 13 [2024-11-28 04:48:55,706 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 31 treesize of output 13 [2024-11-28 04:48:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:48:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-28 04:48:55,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:56,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:48:56,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447417961] [2024-11-28 04:48:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447417961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:48:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [987766641] [2024-11-28 04:48:56,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:48:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:48:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:48:56,478 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:48:56,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-28 04:48:58,085 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:48:58,085 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:48:58,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 04:48:58,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:59,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:49:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [987766641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:49:02,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:49:02,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 04:49:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626225975] [2024-11-28 04:49:02,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:49:02,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 04:49:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:49:02,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 04:49:02,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 04:49:02,877 INFO L87 Difference]: Start difference. First operand 1647 states and 1969 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:50:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:12,510 INFO L93 Difference]: Finished difference Result 1749 states and 2126 transitions. [2024-11-28 04:50:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-11-28 04:50:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-28 04:50:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:12,516 INFO L225 Difference]: With dead ends: 1749 [2024-11-28 04:50:12,516 INFO L226 Difference]: Without dead ends: 1733 [2024-11-28 04:50:12,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6120 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=5452, Invalid=19357, Unknown=1, NotChecked=312, Total=25122 [2024-11-28 04:50:12,522 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1243 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 20205 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 18178 SdHoareTripleChecker+Invalid, 20288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 20205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:12,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 18178 Invalid, 20288 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [83 Valid, 20205 Invalid, 0 Unknown, 0 Unchecked, 51.4s Time] [2024-11-28 04:50:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-11-28 04:50:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2024-11-28 04:50:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1254 states have (on average 1.621212121212121) internal successors, (2033), 1717 states have internal predecessors, (2033), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:50:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2067 transitions. [2024-11-28 04:50:12,553 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2067 transitions. Word has length 90 [2024-11-28 04:50:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:12,553 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2067 transitions. [2024-11-28 04:50:12,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:50:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2067 transitions. [2024-11-28 04:50:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:50:12,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:12,555 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:12,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-28 04:50:12,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-28 04:50:12,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:50:12,956 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:50:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -857268709, now seen corresponding path program 1 times [2024-11-28 04:50:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:50:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656133068] [2024-11-28 04:50:12,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:50:12,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:50:12,962 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:50:12,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 04:50:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:13,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 04:50:13,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:50:13,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:50:13,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:50:13,728 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 13 treesize of output 13 [2024-11-28 04:50:13,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:50:14,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:14,494 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 44 treesize of output 43 [2024-11-28 04:50:14,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:14,624 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 44 treesize of output 43 [2024-11-28 04:50:14,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:50:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:50:14,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:50:14,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:50:15,350 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 04:50:15,350 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 37 treesize of output 36 [2024-11-28 04:50:15,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1649))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1603)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 04:50:15,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:50:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656133068] [2024-11-28 04:50:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656133068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:50:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [680162897] [2024-11-28 04:50:15,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:15,363 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:50:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:50:15,366 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:50:15,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-28 04:50:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:18,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 04:50:18,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:50:18,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:50:18,851 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:50:18,851 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 27 [2024-11-28 04:50:18,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:50:19,175 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 24 treesize of output 12 [2024-11-28 04:50:20,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:20,611 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 44 treesize of output 43 [2024-11-28 04:50:20,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:20,878 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 44 treesize of output 43 [2024-11-28 04:50:20,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:50:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:50:21,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:50:21,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2021) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 04:50:21,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:50:21,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2021)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:50:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [680162897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:50:21,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:50:21,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-28 04:50:21,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361867708] [2024-11-28 04:50:21,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:50:21,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:50:21,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:50:21,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:50:21,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=347, Unknown=13, NotChecked=210, Total=650 [2024-11-28 04:50:21,629 INFO L87 Difference]: Start difference. First operand 1733 states and 2067 transitions. Second operand has 19 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:50:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:36,695 INFO L93 Difference]: Finished difference Result 1734 states and 2068 transitions. [2024-11-28 04:50:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:50:36,695 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-28 04:50:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:36,698 INFO L225 Difference]: With dead ends: 1734 [2024-11-28 04:50:36,698 INFO L226 Difference]: Without dead ends: 1734 [2024-11-28 04:50:36,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=458, Unknown=13, NotChecked=240, Total=812 [2024-11-28 04:50:36,699 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1144 mSDsluCounter, 6364 mSDsCounter, 0 mSdLazyCounter, 6686 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 7023 SdHoareTripleChecker+Invalid, 6707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:36,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 7023 Invalid, 6707 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 6686 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2024-11-28 04:50:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-11-28 04:50:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-11-28 04:50:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1254 states have (on average 1.6196172248803828) internal successors, (2031), 1716 states have internal predecessors, (2031), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:50:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2065 transitions. [2024-11-28 04:50:36,721 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2065 transitions. Word has length 115 [2024-11-28 04:50:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:36,721 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2065 transitions. [2024-11-28 04:50:36,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.5625) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:50:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2065 transitions. [2024-11-28 04:50:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:50:36,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:36,723 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:36,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-28 04:50:36,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-28 04:50:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:50:37,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:50:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -857268708, now seen corresponding path program 1 times [2024-11-28 04:50:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:50:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588809127] [2024-11-28 04:50:37,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:50:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:50:37,126 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:50:37,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 04:50:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:37,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 04:50:37,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:50:37,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:50:37,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:50:37,758 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:50:37,759 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 13 treesize of output 13 [2024-11-28 04:50:37,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:50:37,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:50:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:50:37,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:50:38,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:38,762 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 62 treesize of output 57 [2024-11-28 04:50:38,774 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 13 [2024-11-28 04:50:38,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:50:38,880 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 62 treesize of output 57 [2024-11-28 04:50:38,898 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 13 [2024-11-28 04:50:38,928 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 31 treesize of output 13 [2024-11-28 04:50:38,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:50:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:50:38,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:50:39,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-28 04:50:39,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-28 04:50:40,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2577))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2578) .cse0 v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2578) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 04:50:40,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:50:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588809127] [2024-11-28 04:50:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588809127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:50:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1994790647] [2024-11-28 04:50:40,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:40,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:50:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:50:40,907 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:50:40,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-28 04:50:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:44,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-28 04:50:44,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:50:44,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:50:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:50:44,610 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-28 04:50:44,611 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 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-28 04:50:44,657 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:50:44,657 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 13 treesize of output 13 [2024-11-28 04:50:44,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:50:44,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:50:44,894 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 17 treesize of output 9 [2024-11-28 04:50:44,970 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 7 treesize of output 3 [2024-11-28 04:50:45,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:50:45,845 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 [2024-11-28 04:50:46,198 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2024-11-28 04:50:46,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-28 04:50:46,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:50:46,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-28 04:50:46,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:50:46,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:50:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:50:46,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:50:47,120 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 239 treesize of output 167 [2024-11-28 04:50:57,215 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 48 DAG size of output: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:51:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1994790647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:51:23,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:51:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-28 04:51:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610567124] [2024-11-28 04:51:23,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:51:23,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:51:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:51:23,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:51:23,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=520, Unknown=11, NotChecked=144, Total=756 [2024-11-28 04:51:23,519 INFO L87 Difference]: Start difference. First operand 1732 states and 2065 transitions. Second operand has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:52:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:58,976 INFO L93 Difference]: Finished difference Result 2408 states and 2798 transitions. [2024-11-28 04:52:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:52:58,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-28 04:52:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:58,983 INFO L225 Difference]: With dead ends: 2408 [2024-11-28 04:52:58,983 INFO L226 Difference]: Without dead ends: 2408 [2024-11-28 04:52:58,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=163, Invalid=894, Unknown=11, NotChecked=192, Total=1260 [2024-11-28 04:52:58,985 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2895 mSDsluCounter, 4398 mSDsCounter, 0 mSdLazyCounter, 9695 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2913 SdHoareTripleChecker+Valid, 4861 SdHoareTripleChecker+Invalid, 9730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 9695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2913 Valid, 4861 Invalid, 9730 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 9695 Invalid, 0 Unknown, 0 Unchecked, 92.6s Time] [2024-11-28 04:52:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-11-28 04:52:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1731. [2024-11-28 04:52:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1254 states have (on average 1.6180223285486444) internal successors, (2029), 1715 states have internal predecessors, (2029), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:52:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2063 transitions. [2024-11-28 04:52:59,011 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2063 transitions. Word has length 115 [2024-11-28 04:52:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2063 transitions. [2024-11-28 04:52:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:52:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2063 transitions. [2024-11-28 04:52:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:52:59,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:59,013 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:52:59,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-28 04:52:59,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-28 04:52:59,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:52:59,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:52:59,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1016252987, now seen corresponding path program 1 times [2024-11-28 04:52:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:52:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703350022] [2024-11-28 04:52:59,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:52:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:52:59,418 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:52:59,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-28 04:52:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:59,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 04:52:59,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:00,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:53:00,956 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:53:00,956 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 13 treesize of output 13 [2024-11-28 04:53:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:53:03,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:03,685 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 44 treesize of output 43 [2024-11-28 04:53:04,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:04,214 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 44 treesize of output 43 [2024-11-28 04:53:04,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:04,620 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 44 treesize of output 43 [2024-11-28 04:53:04,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:53:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:53:04,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:05,102 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3378) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 04:53:05,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3378) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:53:05,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3378)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:53:05,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3377 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3377))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3378)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:53:06,532 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 04:53:06,532 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 61 treesize of output 60 [2024-11-28 04:53:06,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3424))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3377)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3378)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 04:53:06,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:53:06,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703350022] [2024-11-28 04:53:06,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703350022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:06,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254021773] [2024-11-28 04:53:06,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:53:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:53:06,577 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:53:06,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-28 04:53:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:09,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 04:53:09,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:09,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:53:11,052 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:53:11,052 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 27 [2024-11-28 04:53:11,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:53:12,306 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 24 treesize of output 12 [2024-11-28 04:53:17,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:17,758 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 44 treesize of output 43 [2024-11-28 04:53:18,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:18,670 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 44 treesize of output 43 [2024-11-28 04:53:19,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:53:19,329 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 44 treesize of output 43 [2024-11-28 04:53:19,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:53:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:53:19,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:20,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:53:20,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:53:20,501 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3802))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:53:21,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3849))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 04:53:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1254021773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:21,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:53:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-28 04:53:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841329323] [2024-11-28 04:53:21,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:53:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:53:21,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:53:21,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=423, Unknown=18, NotChecked=450, Total=992 [2024-11-28 04:53:21,950 INFO L87 Difference]: Start difference. First operand 1731 states and 2063 transitions. Second operand has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:42,193 INFO L93 Difference]: Finished difference Result 1732 states and 2064 transitions. [2024-11-28 04:54:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:54:42,194 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 04:54:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:42,199 INFO L225 Difference]: With dead ends: 1732 [2024-11-28 04:54:42,199 INFO L226 Difference]: Without dead ends: 1732 [2024-11-28 04:54:42,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=122, Invalid=546, Unknown=18, NotChecked=504, Total=1190 [2024-11-28 04:54:42,204 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1139 mSDsluCounter, 7635 mSDsCounter, 0 mSdLazyCounter, 7892 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8293 SdHoareTripleChecker+Invalid, 7912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:42,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8293 Invalid, 7912 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7892 Invalid, 0 Unknown, 0 Unchecked, 79.4s Time] [2024-11-28 04:54:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2024-11-28 04:54:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1730. [2024-11-28 04:54:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1254 states have (on average 1.6164274322169059) internal successors, (2027), 1714 states have internal predecessors, (2027), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:54:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2061 transitions. [2024-11-28 04:54:42,235 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2061 transitions. Word has length 118 [2024-11-28 04:54:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2061 transitions. [2024-11-28 04:54:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2061 transitions. [2024-11-28 04:54:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:54:42,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:42,239 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:42,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-28 04:54:42,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-28 04:54:42,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:42,640 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 04:54:42,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1016252986, now seen corresponding path program 1 times [2024-11-28 04:54:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:54:42,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42658692] [2024-11-28 04:54:42,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:42,643 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:42,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-28 04:54:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:43,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-28 04:54:43,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:54:44,283 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:54:44,283 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 13 treesize of output 13 [2024-11-28 04:54:44,337 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 6 treesize of output 5 [2024-11-28 04:54:44,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:54:44,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:54:45,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:54:45,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:54:49,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:54:49,245 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 62 treesize of output 57 [2024-11-28 04:54:49,266 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 13 [2024-11-28 04:54:49,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:54:49,863 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 62 treesize of output 57 [2024-11-28 04:54:49,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:54:50,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:54:50,429 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 62 treesize of output 57 [2024-11-28 04:54:50,486 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 13 [2024-11-28 04:54:50,586 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 31 treesize of output 13 [2024-11-28 04:54:50,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:54:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:54:50,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:51,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:54:51,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-28 04:54:51,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4273) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4274))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4273) .cse2 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 04:54:51,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4273) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4274))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4273) .cse3 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 04:54:55,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4367))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4368) .cse1 v_ArrVal_4273) (select (select (store .cse2 .cse1 v_ArrVal_4274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4276))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4367))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4274))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4368) .cse4 v_ArrVal_4273) .cse5 v_ArrVal_4276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 04:54:55,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:54:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42658692] [2024-11-28 04:54:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42658692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1223823818] [2024-11-28 04:54:55,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:54:55,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:54:55,916 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:54:55,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f399a9f6-2384-4d6c-8962-e80e213da5a0/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-28 04:55:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:04,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-28 04:55:04,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:04,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:55:06,782 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:55:06,783 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 13 treesize of output 13 [2024-11-28 04:55:06,824 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 6 treesize of output 5 [2024-11-28 04:55:07,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:55:07,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:55:08,160 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 18 treesize of output 10 [2024-11-28 04:55:08,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:55:12,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:55:12,117 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 50 treesize of output 45 [2024-11-28 04:55:12,173 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 [2024-11-28 04:55:12,977 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2024-11-28 04:55:13,034 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 [2024-11-28 04:55:14,080 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-28 04:55:14,081 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2024-11-28 04:55:14,124 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 [2024-11-28 04:55:14,185 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 [2024-11-28 04:55:14,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:55:14,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:55:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:55:14,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:14,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:55:14,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 04:55:15,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 (store (select |c_#memory_$Pointer$#2.base| .cse0) (bvadd (_ bv16 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4792) .cse1 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))))) is different from false [2024-11-28 04:55:19,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse1 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887))) (store (store .cse1 .cse2 v_ArrVal_4792) (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd (_ bv16 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4794))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4886))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4887))) (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) (bvadd (_ bv16 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv12 32) (select (select (store (store .cse5 .cse6 v_ArrVal_4792) .cse7 v_ArrVal_4794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_4795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-28 04:55:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1223823818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:19,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:55:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2024-11-28 04:55:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346525698] [2024-11-28 04:55:19,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:55:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:55:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:55:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=345, Unknown=23, NotChecked=414, Total=870 [2024-11-28 04:55:19,708 INFO L87 Difference]: Start difference. First operand 1730 states and 2061 transitions. Second operand has 18 states, 15 states have (on average 9.2) internal successors, (138), 18 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)