./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd --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 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:31:43,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:31:43,717 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:31:43,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:31:43,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:31:43,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:31:43,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:31:43,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:31:43,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:31:43,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:31:43,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:31:43,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:31:43,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:31:43,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:31:43,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:31:43,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:31:43,756 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:31:43,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:31:43,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:31:43,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:31:43,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:31:43,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:31:43,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:31:43,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:31:43,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:31:43,759 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_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2024-11-13 13:31:44,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:31:44,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:31:44,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:31:44,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:31:44,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:31:44,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i Unable to find full path for "g++" [2024-11-13 13:31:46,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:31:46,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:31:46,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2024-11-13 13:31:46,481 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/data/6b538c769/fccb366be6af49569aae1c16c99ce81c/FLAGd8e111805 [2024-11-13 13:31:46,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/data/6b538c769/fccb366be6af49569aae1c16c99ce81c [2024-11-13 13:31:46,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:31:46,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:31:46,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:31:46,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:31:46,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:31:46,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:31:46" (1/1) ... [2024-11-13 13:31:46,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e2e88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:46, skipping insertion in model container [2024-11-13 13:31:46,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:31:46" (1/1) ... [2024-11-13 13:31:46,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:31:47,204 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,263 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,269 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,280 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,288 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,303 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:31:47,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:31:47,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:31:47,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:31:47,440 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:31:47,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47 WrapperNode [2024-11-13 13:31:47,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:31:47,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:31:47,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:31:47,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:31:47,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,526 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 831 [2024-11-13 13:31:47,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:31:47,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:31:47,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:31:47,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:31:47,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,598 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [156, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 42 writes are split as follows [42, 0]. [2024-11-13 13:31:47,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:31:47,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:31:47,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:31:47,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:31:47,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (1/1) ... [2024-11-13 13:31:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:31:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:47,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:31:47,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:31:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:31:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:31:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 13:31:47,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 13:31:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:31:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 13:31:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 13:31:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:31:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:31:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:31:47,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:31:47,920 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:31:47,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:31:47,923 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:31:47,967 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 13:31:49,957 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-13 13:31:49,958 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:31:49,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:31:50,006 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-13 13:31:50,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:31:50 BoogieIcfgContainer [2024-11-13 13:31:50,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:31:50,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:31:50,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:31:50,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:31:50,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:31:46" (1/3) ... [2024-11-13 13:31:50,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cab97c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:31:50, skipping insertion in model container [2024-11-13 13:31:50,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:31:47" (2/3) ... [2024-11-13 13:31:50,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cab97c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:31:50, skipping insertion in model container [2024-11-13 13:31:50,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:31:50" (3/3) ... [2024-11-13 13:31:50,017 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2024-11-13 13:31:50,038 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:31:50,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test1-1.i that has 4 procedures, 763 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-13 13:31:50,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:31:50,140 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;@93f6f62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:31:50,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-13 13:31:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:31:50,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:50,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:31:50,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:50,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-13 13:31:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039288197] [2024-11-13 13:31:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:50,436 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-13 13:31:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039288197] [2024-11-13 13:31:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039288197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:31:50,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372643529] [2024-11-13 13:31:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:31:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:31:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:31:50,481 INFO L87 Difference]: Start difference. First operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 13:31:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:51,377 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-13 13:31:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:31:51,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:31:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:51,405 INFO L225 Difference]: With dead ends: 701 [2024-11-13 13:31:51,405 INFO L226 Difference]: Without dead ends: 699 [2024-11-13 13:31:51,407 INFO L431 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-13 13:31:51,413 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:51,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:31:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-13 13:31:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-11-13 13:31:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 419 states have (on average 1.8568019093078758) internal successors, (778), 691 states have internal predecessors, (778), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 804 transitions. [2024-11-13 13:31:51,491 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 804 transitions. Word has length 5 [2024-11-13 13:31:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:51,491 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 804 transitions. [2024-11-13 13:31:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 13:31:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 804 transitions. [2024-11-13 13:31:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:31:51,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:51,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:31:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:31:51,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-13 13:31:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743807975] [2024-11-13 13:31:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:51,619 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-13 13:31:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743807975] [2024-11-13 13:31:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743807975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:31:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352972556] [2024-11-13 13:31:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:51,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:31:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:31:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:31:51,622 INFO L87 Difference]: Start difference. First operand 697 states and 804 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 13:31:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:52,277 INFO L93 Difference]: Finished difference Result 775 states and 888 transitions. [2024-11-13 13:31:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:31:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:31:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:52,281 INFO L225 Difference]: With dead ends: 775 [2024-11-13 13:31:52,282 INFO L226 Difference]: Without dead ends: 775 [2024-11-13 13:31:52,282 INFO L431 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-13 13:31:52,282 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 412 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:52,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 913 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:31:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-13 13:31:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 727. [2024-11-13 13:31:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 459 states have (on average 1.8453159041394336) internal successors, (847), 721 states have internal predecessors, (847), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 873 transitions. [2024-11-13 13:31:52,316 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 873 transitions. Word has length 5 [2024-11-13 13:31:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 873 transitions. [2024-11-13 13:31:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 13:31:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 873 transitions. [2024-11-13 13:31:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 13:31:52,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:52,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:31:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:31:52,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1423324823, now seen corresponding path program 1 times [2024-11-13 13:31:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860559539] [2024-11-13 13:31:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:52,370 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-13 13:31:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:52,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860559539] [2024-11-13 13:31:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860559539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:52,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:31:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046284821] [2024-11-13 13:31:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:52,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:31:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:31:52,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:31:52,371 INFO L87 Difference]: Start difference. First operand 727 states and 873 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-13 13:31:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:52,440 INFO L93 Difference]: Finished difference Result 1404 states and 1676 transitions. [2024-11-13 13:31:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:31:52,441 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-13 13:31:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:52,446 INFO L225 Difference]: With dead ends: 1404 [2024-11-13 13:31:52,447 INFO L226 Difference]: Without dead ends: 1404 [2024-11-13 13:31:52,447 INFO L431 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-13 13:31:52,447 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:52,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1578 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:31:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-13 13:31:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 728. [2024-11-13 13:31:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-13 13:31:52,477 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-13 13:31:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:52,477 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-13 13:31:52,477 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-13 13:31:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-13 13:31:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:31:52,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:52,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:31:52,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610682, now seen corresponding path program 1 times [2024-11-13 13:31:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139169764] [2024-11-13 13:31:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:52,627 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-13 13:31:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139169764] [2024-11-13 13:31:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139169764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:31:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69379553] [2024-11-13 13:31:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:31:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:31:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:31:52,629 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 13:31:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:53,408 INFO L93 Difference]: Finished difference Result 754 states and 927 transitions. [2024-11-13 13:31:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:31:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-13 13:31:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:53,412 INFO L225 Difference]: With dead ends: 754 [2024-11-13 13:31:53,412 INFO L226 Difference]: Without dead ends: 754 [2024-11-13 13:31:53,413 INFO L431 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-13 13:31:53,413 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 965 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:53,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:31:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-13 13:31:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2024-11-13 13:31:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 460 states have (on average 1.7934782608695652) internal successors, (825), 699 states have internal predecessors, (825), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 851 transitions. [2024-11-13 13:31:53,434 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 851 transitions. Word has length 11 [2024-11-13 13:31:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:53,434 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 851 transitions. [2024-11-13 13:31:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 13:31:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 851 transitions. [2024-11-13 13:31:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:31:53,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:53,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:53,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:31:53,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:53,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610681, now seen corresponding path program 1 times [2024-11-13 13:31:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:53,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791054235] [2024-11-13 13:31:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:53,553 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-13 13:31:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791054235] [2024-11-13 13:31:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791054235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:53,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:53,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:31:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649001984] [2024-11-13 13:31:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:31:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:31:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:31:53,556 INFO L87 Difference]: Start difference. First operand 705 states and 851 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 13:31:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:53,595 INFO L93 Difference]: Finished difference Result 630 states and 748 transitions. [2024-11-13 13:31:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:31:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-13 13:31:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:53,598 INFO L225 Difference]: With dead ends: 630 [2024-11-13 13:31:53,598 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 13:31:53,599 INFO L431 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-13 13:31:53,600 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 61 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1259 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-13 13:31:53,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:31:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 13:31:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-13 13:31:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.818639798488665) internal successors, (722), 624 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-13 13:31:53,627 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 11 [2024-11-13 13:31:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:53,627 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-13 13:31:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 13:31:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-13 13:31:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:31:53,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:53,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:53,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:31:53,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:53,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 614446658, now seen corresponding path program 1 times [2024-11-13 13:31:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061148159] [2024-11-13 13:31:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:53,747 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-13 13:31:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061148159] [2024-11-13 13:31:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061148159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:53,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:31:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777927862] [2024-11-13 13:31:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:31:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:31:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:31:53,749 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-13 13:31:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:53,819 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2024-11-13 13:31:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:31:53,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-13 13:31:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:53,822 INFO L225 Difference]: With dead ends: 612 [2024-11-13 13:31:53,824 INFO L226 Difference]: Without dead ends: 612 [2024-11-13 13:31:53,825 INFO L431 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-13 13:31:53,825 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 41 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:53,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:31:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-13 13:31:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-13 13:31:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.8120104438642297) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2024-11-13 13:31:53,849 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 13 [2024-11-13 13:31:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2024-11-13 13:31:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-13 13:31:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2024-11-13 13:31:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:31:53,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:53,851 INFO L215 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] [2024-11-13 13:31:53,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:31:53,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 448345584, now seen corresponding path program 1 times [2024-11-13 13:31:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545223434] [2024-11-13 13:31:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:54,100 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-13 13:31:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545223434] [2024-11-13 13:31:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545223434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:31:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055199] [2024-11-13 13:31:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:31:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:31:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:31:54,103 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-13 13:31:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:54,787 INFO L93 Difference]: Finished difference Result 702 states and 807 transitions. [2024-11-13 13:31:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:31:54,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-13 13:31:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:54,790 INFO L225 Difference]: With dead ends: 702 [2024-11-13 13:31:54,791 INFO L226 Difference]: Without dead ends: 702 [2024-11-13 13:31:54,792 INFO L431 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-13 13:31:54,793 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 417 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:54,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1136 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:31:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-13 13:31:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 605. [2024-11-13 13:31:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.8015665796344646) internal successors, (690), 599 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 716 transitions. [2024-11-13 13:31:54,815 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 716 transitions. Word has length 27 [2024-11-13 13:31:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:54,815 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 716 transitions. [2024-11-13 13:31:54,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-13 13:31:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 716 transitions. [2024-11-13 13:31:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 13:31:54,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:54,819 INFO L215 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] [2024-11-13 13:31:54,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:31:54,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -234532926, now seen corresponding path program 1 times [2024-11-13 13:31:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256719745] [2024-11-13 13:31:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:54,975 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-13 13:31:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256719745] [2024-11-13 13:31:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256719745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:31:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882518151] [2024-11-13 13:31:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:31:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:31:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:31:54,977 INFO L87 Difference]: Start difference. First operand 605 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-13 13:31:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:55,033 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2024-11-13 13:31:55,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:31:55,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-13 13:31:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:55,036 INFO L225 Difference]: With dead ends: 605 [2024-11-13 13:31:55,036 INFO L226 Difference]: Without dead ends: 605 [2024-11-13 13:31:55,036 INFO L431 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-13 13:31:55,037 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 21 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1817 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-13 13:31:55,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1817 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:31:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-13 13:31:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-13 13:31:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7911227154046998) internal successors, (686), 599 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 712 transitions. [2024-11-13 13:31:55,055 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 712 transitions. Word has length 61 [2024-11-13 13:31:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:55,055 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 712 transitions. [2024-11-13 13:31:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-13 13:31:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 712 transitions. [2024-11-13 13:31:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 13:31:55,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:55,059 INFO L215 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-13 13:31:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:31:55,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:55,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2013989618, now seen corresponding path program 1 times [2024-11-13 13:31:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91360613] [2024-11-13 13:31:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:55,288 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-13 13:31:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91360613] [2024-11-13 13:31:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91360613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:31:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85590409] [2024-11-13 13:31:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:55,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:31:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:31:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:31:55,291 INFO L87 Difference]: Start difference. First operand 605 states and 712 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 13:31:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:55,339 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2024-11-13 13:31:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:31:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-13 13:31:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:55,344 INFO L225 Difference]: With dead ends: 697 [2024-11-13 13:31:55,345 INFO L226 Difference]: Without dead ends: 697 [2024-11-13 13:31:55,345 INFO L431 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-13 13:31:55,347 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 54 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:55,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:31:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-13 13:31:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-13 13:31:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 475 states have (on average 1.694736842105263) internal successors, (805), 691 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 831 transitions. [2024-11-13 13:31:55,364 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 831 transitions. Word has length 69 [2024-11-13 13:31:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 831 transitions. [2024-11-13 13:31:55,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 13:31:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 831 transitions. [2024-11-13 13:31:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 13:31:55,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:55,368 INFO L215 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] [2024-11-13 13:31:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:31:55,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1821260209, now seen corresponding path program 1 times [2024-11-13 13:31:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281041636] [2024-11-13 13:31:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:56,171 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-13 13:31:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281041636] [2024-11-13 13:31:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281041636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:31:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041812118] [2024-11-13 13:31:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:31:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:31:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:31:56,174 INFO L87 Difference]: Start difference. First operand 697 states and 831 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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-13 13:31:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:57,110 INFO L93 Difference]: Finished difference Result 659 states and 793 transitions. [2024-11-13 13:31:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:31:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-13 13:31:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:57,115 INFO L225 Difference]: With dead ends: 659 [2024-11-13 13:31:57,115 INFO L226 Difference]: Without dead ends: 659 [2024-11-13 13:31:57,115 INFO L431 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-13 13:31:57,116 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 914 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:57,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 782 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:31:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-13 13:31:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 619. [2024-11-13 13:31:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.5816091954022988) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-13 13:31:57,145 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 72 [2024-11-13 13:31:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:57,145 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-13 13:31:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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-13 13:31:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-13 13:31:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 13:31:57,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:57,148 INFO L215 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] [2024-11-13 13:31:57,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:31:57,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -840152991, now seen corresponding path program 1 times [2024-11-13 13:31:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766313593] [2024-11-13 13:31:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:57,529 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-13 13:31:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766313593] [2024-11-13 13:31:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766313593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:31:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340843859] [2024-11-13 13:31:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:31:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:31:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:31:57,531 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-13 13:31:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:58,148 INFO L93 Difference]: Finished difference Result 618 states and 713 transitions. [2024-11-13 13:31:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:31:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-13 13:31:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:58,151 INFO L225 Difference]: With dead ends: 618 [2024-11-13 13:31:58,151 INFO L226 Difference]: Without dead ends: 618 [2024-11-13 13:31:58,152 INFO L431 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-13 13:31:58,152 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:58,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1669 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:31:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-13 13:31:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-13 13:31:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.5793103448275863) internal successors, (687), 612 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-13 13:31:58,168 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 77 [2024-11-13 13:31:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-13 13:31:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-13 13:31:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-13 13:31:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 13:31:58,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:58,170 INFO L215 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] [2024-11-13 13:31:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:31:58,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -840152990, now seen corresponding path program 1 times [2024-11-13 13:31:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200383] [2024-11-13 13:31:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:58,737 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-13 13:31:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200383] [2024-11-13 13:31:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:31:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913009450] [2024-11-13 13:31:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:31:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:58,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:31:58,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:31:58,741 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-13 13:31:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:59,463 INFO L93 Difference]: Finished difference Result 617 states and 712 transitions. [2024-11-13 13:31:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:31:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-13 13:31:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:59,466 INFO L225 Difference]: With dead ends: 617 [2024-11-13 13:31:59,467 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 13:31:59,467 INFO L431 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-13 13:31:59,467 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:59,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1676 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:31:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 13:31:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-13 13:31:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 434 states have (on average 1.5806451612903225) internal successors, (686), 611 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:31:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 712 transitions. [2024-11-13 13:31:59,483 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 712 transitions. Word has length 77 [2024-11-13 13:31:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:59,483 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 712 transitions. [2024-11-13 13:31:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-13 13:31:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 712 transitions. [2024-11-13 13:31:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:31:59,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:59,484 INFO L215 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] [2024-11-13 13:31:59,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:31:59,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:31:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1202796120, now seen corresponding path program 1 times [2024-11-13 13:31:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:31:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777541972] [2024-11-13 13:31:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:31:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:31:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:59,846 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-13 13:31:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:31:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777541972] [2024-11-13 13:31:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777541972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:31:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:31:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:31:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382442761] [2024-11-13 13:31:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:31:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:31:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:31:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:31:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:31:59,850 INFO L87 Difference]: Start difference. First operand 617 states and 712 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:32:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:00,863 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-13 13:32:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:32:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 13:32:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:00,866 INFO L225 Difference]: With dead ends: 629 [2024-11-13 13:32:00,866 INFO L226 Difference]: Without dead ends: 629 [2024-11-13 13:32:00,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:32:00,867 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 16 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:00,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2460 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:32:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-13 13:32:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2024-11-13 13:32:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 616 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 13:32:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-13 13:32:00,884 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 85 [2024-11-13 13:32:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:00,885 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-13 13:32:00,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:32:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-13 13:32:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 13:32:00,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:00,887 INFO L215 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] [2024-11-13 13:32:00,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:32:00,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1202796119, now seen corresponding path program 1 times [2024-11-13 13:32:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860086625] [2024-11-13 13:32:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:01,535 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-13 13:32:01,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860086625] [2024-11-13 13:32:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860086625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:01,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:32:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207289787] [2024-11-13 13:32:01,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:32:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:32:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:32:01,538 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:32:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:02,533 INFO L93 Difference]: Finished difference Result 623 states and 721 transitions. [2024-11-13 13:32:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:32:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 13:32:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:02,537 INFO L225 Difference]: With dead ends: 623 [2024-11-13 13:32:02,537 INFO L226 Difference]: Without dead ends: 623 [2024-11-13 13:32:02,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:32:02,537 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 11 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:02,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2496 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:32:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-13 13:32:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-13 13:32:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5763097949886105) internal successors, (692), 616 states have internal predecessors, (692), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-13 13:32:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 721 transitions. [2024-11-13 13:32:02,554 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 721 transitions. Word has length 85 [2024-11-13 13:32:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:02,554 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 721 transitions. [2024-11-13 13:32:02,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 13:32:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 721 transitions. [2024-11-13 13:32:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 13:32:02,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:02,555 INFO L215 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-13 13:32:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:32:02,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1663030012, now seen corresponding path program 1 times [2024-11-13 13:32:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443015395] [2024-11-13 13:32:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:03,217 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-13 13:32:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443015395] [2024-11-13 13:32:03,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443015395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781443596] [2024-11-13 13:32:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:03,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:03,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:03,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:03,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:32:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:03,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:32:03,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:03,653 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:32:03,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:32:03,710 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-13 13:32:03,838 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-13 13:32:04,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:04,091 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-13 13:32:04,170 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-13 13:32:04,228 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-13 13:32:04,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:04,273 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 13:32:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781443596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:04,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:04,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-13 13:32:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677565101] [2024-11-13 13:32:04,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:04,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:32:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:32:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-13 13:32:04,277 INFO L87 Difference]: Start difference. First operand 623 states and 721 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 13:32:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:07,089 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-13 13:32:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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 86 [2024-11-13 13:32:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:07,092 INFO L225 Difference]: With dead ends: 630 [2024-11-13 13:32:07,092 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 13:32:07,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-13 13:32:07,093 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 508 mSDsluCounter, 3600 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:07,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3958 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:32:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 13:32:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 627. [2024-11-13 13:32:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 443 states have (on average 1.5711060948081264) internal successors, (696), 619 states have internal predecessors, (696), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 723 transitions. [2024-11-13 13:32:07,107 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 723 transitions. Word has length 86 [2024-11-13 13:32:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:07,107 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 723 transitions. [2024-11-13 13:32:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 13:32:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 723 transitions. [2024-11-13 13:32:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 13:32:07,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:07,109 INFO L215 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-13 13:32:07,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:32:07,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:32:07,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1663030011, now seen corresponding path program 1 times [2024-11-13 13:32:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428091799] [2024-11-13 13:32:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:08,277 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-13 13:32:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428091799] [2024-11-13 13:32:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428091799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085145150] [2024-11-13 13:32:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:08,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:08,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:08,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:08,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:32:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:08,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 13:32:08,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:08,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:08,644 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-13 13:32:08,654 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-13 13:32:08,690 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-13 13:32:08,695 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-13 13:32:08,826 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-13 13:32:08,832 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-13 13:32:08,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:08,974 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-13 13:32:08,983 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-13 13:32:09,038 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-13 13:32:09,045 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-13 13:32:09,071 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-13 13:32:09,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085145150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:09,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-13 13:32:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822852247] [2024-11-13 13:32:09,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:32:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:32:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=382, Unknown=15, NotChecked=0, Total=462 [2024-11-13 13:32:09,270 INFO L87 Difference]: Start difference. First operand 627 states and 723 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 13:32:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:12,020 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-13 13:32:12,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:32:12,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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 86 [2024-11-13 13:32:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:12,023 INFO L225 Difference]: With dead ends: 629 [2024-11-13 13:32:12,023 INFO L226 Difference]: Without dead ends: 629 [2024-11-13 13:32:12,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=580, Unknown=16, NotChecked=0, Total=702 [2024-11-13 13:32:12,024 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 512 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:12,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3074 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:32:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-13 13:32:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2024-11-13 13:32:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 438 states have (on average 1.5730593607305936) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:32:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-13 13:32:12,037 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 86 [2024-11-13 13:32:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:12,037 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-13 13:32:12,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 13:32:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-13 13:32:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:32:12,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:12,038 INFO L215 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] [2024-11-13 13:32:12,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:32:12,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:32:12,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 413540408, now seen corresponding path program 1 times [2024-11-13 13:32:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093416950] [2024-11-13 13:32:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:12,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:12,846 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-13 13:32:12,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:12,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093416950] [2024-11-13 13:32:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093416950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:12,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:32:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14306765] [2024-11-13 13:32:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:12,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:32:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:32:12,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:32:12,849 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 13:32:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:14,463 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 13:32:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:32:14,463 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-13 13:32:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:14,465 INFO L225 Difference]: With dead ends: 633 [2024-11-13 13:32:14,465 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 13:32:14,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:32:14,466 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 514 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:14,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2944 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:32:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 13:32:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2024-11-13 13:32:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5672645739910314) internal successors, (699), 621 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 726 transitions. [2024-11-13 13:32:14,490 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 726 transitions. Word has length 88 [2024-11-13 13:32:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 726 transitions. [2024-11-13 13:32:14,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 13:32:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 726 transitions. [2024-11-13 13:32:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:32:14,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:14,492 INFO L215 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] [2024-11-13 13:32:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:32:14,492 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash 413540409, now seen corresponding path program 1 times [2024-11-13 13:32:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869114830] [2024-11-13 13:32:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:15,313 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-13 13:32:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869114830] [2024-11-13 13:32:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869114830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:32:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618128075] [2024-11-13 13:32:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:15,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:32:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:32:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:32:15,315 INFO L87 Difference]: Start difference. First operand 629 states and 726 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 13:32:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:16,919 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 13:32:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:32:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-13 13:32:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:16,923 INFO L225 Difference]: With dead ends: 632 [2024-11-13 13:32:16,923 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 13:32:16,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:32:16,923 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 525 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:16,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2376 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:32:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 13:32:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-13 13:32:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5650224215246638) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-13 13:32:16,937 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 88 [2024-11-13 13:32:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-13 13:32:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 13:32:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-13 13:32:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 13:32:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:16,938 INFO L215 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-13 13:32:16,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:32:16,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:16,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -878727332, now seen corresponding path program 1 times [2024-11-13 13:32:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:16,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115645425] [2024-11-13 13:32:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:17,521 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-13 13:32:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115645425] [2024-11-13 13:32:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115645425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796884309] [2024-11-13 13:32:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:17,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:17,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:32:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:17,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:32:17,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:17,913 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:32:17,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:32:17,955 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-13 13:32:18,064 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-13 13:32:18,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:18,256 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-13 13:32:18,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:18,377 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-13 13:32:18,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:32:18,446 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-13 13:32:18,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:18,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_894)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:32:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796884309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:18,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2024-11-13 13:32:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911370894] [2024-11-13 13:32:18,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:18,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 13:32:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 13:32:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=420, Unknown=14, NotChecked=42, Total=552 [2024-11-13 13:32:18,571 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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-13 13:32:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:20,546 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-13 13:32:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:32:20,547 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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 89 [2024-11-13 13:32:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:20,549 INFO L225 Difference]: With dead ends: 631 [2024-11-13 13:32:20,549 INFO L226 Difference]: Without dead ends: 631 [2024-11-13 13:32:20,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=498, Unknown=14, NotChecked=46, Total=650 [2024-11-13 13:32:20,550 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 521 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:20,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 3915 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 13:32:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-13 13:32:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-13 13:32:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 446 states have (on average 1.562780269058296) internal successors, (697), 620 states have internal predecessors, (697), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 724 transitions. [2024-11-13 13:32:20,564 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 724 transitions. Word has length 89 [2024-11-13 13:32:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:20,564 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 724 transitions. [2024-11-13 13:32:20,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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-13 13:32:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 724 transitions. [2024-11-13 13:32:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 13:32:20,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:20,566 INFO L215 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-13 13:32:20,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:32:20,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:20,770 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:20,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -878727331, now seen corresponding path program 1 times [2024-11-13 13:32:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896321087] [2024-11-13 13:32:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:21,627 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-13 13:32:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896321087] [2024-11-13 13:32:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896321087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728558934] [2024-11-13 13:32:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:21,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:21,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:21,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:32:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:21,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:32:21,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:21,979 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-13 13:32:21,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:21,987 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-13 13:32:21,999 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-13 13:32:22,003 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-13 13:32:22,057 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-13 13:32:22,062 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-13 13:32:22,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:22,196 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-13 13:32:22,207 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-13 13:32:22,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:22,293 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-13 13:32:22,300 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-13 13:32:22,322 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-13 13:32:22,327 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-13 13:32:22,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-13 13:32:22,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:22,494 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1039 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-13 13:32:22,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1045) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1044))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1045) .cse1 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:32:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728558934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:22,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2024-11-13 13:32:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76551803] [2024-11-13 13:32:22,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:32:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:32:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=314, Unknown=14, NotChecked=74, Total=462 [2024-11-13 13:32:22,560 INFO L87 Difference]: Start difference. First operand 628 states and 724 transitions. Second operand has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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-13 13:32:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:25,180 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-13 13:32:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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 89 [2024-11-13 13:32:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:25,183 INFO L225 Difference]: With dead ends: 630 [2024-11-13 13:32:25,183 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 13:32:25,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=632, Unknown=17, NotChecked=106, Total=870 [2024-11-13 13:32:25,184 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 524 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:25,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3016 Invalid, 3464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 13:32:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 13:32:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-13 13:32:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 438 states have (on average 1.5684931506849316) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:32:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-13 13:32:25,194 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 89 [2024-11-13 13:32:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:25,195 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-13 13:32:25,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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-13 13:32:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-13 13:32:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:32:25,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:25,196 INFO L215 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] [2024-11-13 13:32:25,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:32:25,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:25,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1816697551, now seen corresponding path program 1 times [2024-11-13 13:32:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828178446] [2024-11-13 13:32:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:26,018 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-13 13:32:26,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828178446] [2024-11-13 13:32:26,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828178446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:26,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:26,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:32:26,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260851047] [2024-11-13 13:32:26,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:32:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:32:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:32:26,020 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 13:32:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:27,639 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 13:32:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-13 13:32:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:27,642 INFO L225 Difference]: With dead ends: 634 [2024-11-13 13:32:27,642 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 13:32:27,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:32:27,643 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 509 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3284 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:27,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3284 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:32:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 13:32:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-13 13:32:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.55902004454343) internal successors, (700), 622 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 727 transitions. [2024-11-13 13:32:27,653 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 727 transitions. Word has length 91 [2024-11-13 13:32:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:27,654 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 727 transitions. [2024-11-13 13:32:27,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 13:32:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 727 transitions. [2024-11-13 13:32:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:32:27,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:27,655 INFO L215 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] [2024-11-13 13:32:27,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:32:27,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:27,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1816697552, now seen corresponding path program 1 times [2024-11-13 13:32:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318324784] [2024-11-13 13:32:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:28,555 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-13 13:32:28,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318324784] [2024-11-13 13:32:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318324784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:32:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164809205] [2024-11-13 13:32:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:32:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:32:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:32:28,558 INFO L87 Difference]: Start difference. First operand 630 states and 727 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 13:32:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:30,359 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 13:32:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:32:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-13 13:32:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:30,362 INFO L225 Difference]: With dead ends: 633 [2024-11-13 13:32:30,362 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 13:32:30,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:32:30,363 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 531 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:30,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2590 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 13:32:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 13:32:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-13 13:32:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-13 13:32:30,373 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 91 [2024-11-13 13:32:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-13 13:32:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 13:32:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-13 13:32:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:32:30,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:30,375 INFO L215 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-13 13:32:30,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:32:30,375 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:30,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash -339670741, now seen corresponding path program 1 times [2024-11-13 13:32:30,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861710437] [2024-11-13 13:32:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:30,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:31,005 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-13 13:32:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861710437] [2024-11-13 13:32:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861710437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573445872] [2024-11-13 13:32:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:31,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:31,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:31,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:31,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:32:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:31,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:32:31,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:31,397 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:32:31,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:32:31,439 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-13 13:32:31,535 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-13 13:32:31,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:31,697 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-13 13:32:31,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:31,789 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-13 13:32:31,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:31,844 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-13 13:32:31,866 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-13 13:32:31,895 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-13 13:32:31,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:31,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:32:32,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:32:32,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (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$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1327))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:32:32,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573445872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:32,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-11-13 13:32:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832696872] [2024-11-13 13:32:32,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:32,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:32:32,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:32:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=544, Unknown=21, NotChecked=150, Total=812 [2024-11-13 13:32:32,039 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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-13 13:32:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:33,972 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 13:32:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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 92 [2024-11-13 13:32:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:33,975 INFO L225 Difference]: With dead ends: 632 [2024-11-13 13:32:33,975 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 13:32:33,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=634, Unknown=21, NotChecked=162, Total=930 [2024-11-13 13:32:33,976 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 516 mSDsluCounter, 3869 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 4228 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:33,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 4228 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 13:32:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 13:32:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-13 13:32:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 449 states have (on average 1.55456570155902) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-13 13:32:33,994 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 92 [2024-11-13 13:32:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-13 13:32:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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-13 13:32:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-13 13:32:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:32:33,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:33,995 INFO L215 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-13 13:32:34,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:32:34,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:32:34,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash -339670740, now seen corresponding path program 1 times [2024-11-13 13:32:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479867337] [2024-11-13 13:32:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:35,071 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-13 13:32:35,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:35,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479867337] [2024-11-13 13:32:35,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479867337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:35,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894685535] [2024-11-13 13:32:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:35,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:35,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:35,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:32:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:35,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:32:35,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:35,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:35,443 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-13 13:32:35,449 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-13 13:32:35,482 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-13 13:32:35,485 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-13 13:32:35,577 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-13 13:32:35,581 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-13 13:32:35,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:35,693 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-13 13:32:35,703 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-13 13:32:35,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:35,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 62 treesize of output 57 [2024-11-13 13:32:35,799 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-13 13:32:35,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:35,884 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-13 13:32:35,890 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-13 13:32:35,910 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-13 13:32:35,915 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-13 13:32:35,933 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-13 13:32:35,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:36,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:32:36,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1481))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1480) .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:32:36,111 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1481))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1480) .cse2 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 13:32:36,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1489))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1488) .cse0 v_ArrVal_1480) (select (select (store .cse1 .cse0 v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1482))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1489))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1481))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1488) .cse3 v_ArrVal_1480) .cse4 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 13:32:36,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894685535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:36,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2024-11-13 13:32:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131374480] [2024-11-13 13:32:36,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:36,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:32:36,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:36,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:32:36,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=554, Unknown=13, NotChecked=204, Total=870 [2024-11-13 13:32:36,177 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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-13 13:32:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:39,677 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-13 13:32:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:32:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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 92 [2024-11-13 13:32:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:39,680 INFO L225 Difference]: With dead ends: 631 [2024-11-13 13:32:39,680 INFO L226 Difference]: Without dead ends: 631 [2024-11-13 13:32:39,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=895, Unknown=13, NotChecked=260, Total=1332 [2024-11-13 13:32:39,681 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 512 mSDsluCounter, 4339 mSDsCounter, 0 mSdLazyCounter, 5163 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 4698 SdHoareTripleChecker+Invalid, 5203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:39,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 4698 Invalid, 5203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5163 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 13:32:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-13 13:32:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 616. [2024-11-13 13:32:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:32:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-13 13:32:39,693 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 92 [2024-11-13 13:32:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-13 13:32:39,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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-13 13:32:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-13 13:32:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:32:39,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:39,699 INFO L215 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] [2024-11-13 13:32:39,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:32:39,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:32:39,900 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:39,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash 354459647, now seen corresponding path program 1 times [2024-11-13 13:32:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:39,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804062026] [2024-11-13 13:32:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:40,546 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-13 13:32:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804062026] [2024-11-13 13:32:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804062026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:32:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102990731] [2024-11-13 13:32:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:32:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:32:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:32:40,548 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 13:32:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:42,159 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 13:32:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:32:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-13 13:32:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:42,161 INFO L225 Difference]: With dead ends: 635 [2024-11-13 13:32:42,161 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 13:32:42,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:32:42,162 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 534 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:42,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 3274 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:32:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 13:32:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-13 13:32:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-13 13:32:42,172 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 94 [2024-11-13 13:32:42,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:42,172 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-13 13:32:42,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 13:32:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-13 13:32:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:32:42,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:42,173 INFO L215 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] [2024-11-13 13:32:42,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:32:42,173 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash 354459648, now seen corresponding path program 1 times [2024-11-13 13:32:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691382515] [2024-11-13 13:32:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:42,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:43,016 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-13 13:32:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691382515] [2024-11-13 13:32:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691382515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:32:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400025241] [2024-11-13 13:32:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:32:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:32:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:32:43,018 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 13:32:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:44,305 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 13:32:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:32:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-13 13:32:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:44,307 INFO L225 Difference]: With dead ends: 634 [2024-11-13 13:32:44,307 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 13:32:44,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:32:44,308 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 509 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:44,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2127 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:32:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 13:32:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-13 13:32:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5486725663716814) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-13 13:32:44,328 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 94 [2024-11-13 13:32:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:44,329 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-13 13:32:44,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 13:32:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-13 13:32:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:32:44,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:44,330 INFO L215 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-13 13:32:44,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 13:32:44,330 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -187481053, now seen corresponding path program 1 times [2024-11-13 13:32:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486999113] [2024-11-13 13:32:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:45,035 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-13 13:32:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:45,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486999113] [2024-11-13 13:32:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486999113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812808776] [2024-11-13 13:32:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:45,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:45,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:32:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:45,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 13:32:45,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:45,431 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:32:45,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:32:45,470 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-13 13:32:45,565 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-13 13:32:45,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:45,711 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-13 13:32:45,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:45,810 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-13 13:32:45,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:45,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 42 treesize of output 41 [2024-11-13 13:32:45,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:45,946 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-13 13:32:45,961 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-13 13:32:45,996 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-13 13:32:45,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:46,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1793 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:32:46,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:32:46,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1796))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1791)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1792)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:32:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812808776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:46,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:46,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-13 13:32:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454578261] [2024-11-13 13:32:46,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:46,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:32:46,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:32:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=684, Unknown=76, NotChecked=174, Total=1056 [2024-11-13 13:32:46,345 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 26 states, 23 states have (on average 5.608695652173913) internal successors, (129), 25 states have internal predecessors, (129), 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-13 13:32:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:48,865 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-13 13:32:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:32:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.608695652173913) internal successors, (129), 25 states have internal predecessors, (129), 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 95 [2024-11-13 13:32:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:48,867 INFO L225 Difference]: With dead ends: 633 [2024-11-13 13:32:48,867 INFO L226 Difference]: Without dead ends: 633 [2024-11-13 13:32:48,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=903, Unknown=81, NotChecked=198, Total=1332 [2024-11-13 13:32:48,868 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 491 mSDsluCounter, 4487 mSDsCounter, 0 mSdLazyCounter, 3866 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 3890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:48,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 4842 Invalid, 3890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3866 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 13:32:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-13 13:32:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-13 13:32:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 452 states have (on average 1.5464601769911503) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-13 13:32:48,877 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 95 [2024-11-13 13:32:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:48,878 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-13 13:32:48,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.608695652173913) internal successors, (129), 25 states have internal predecessors, (129), 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-13 13:32:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-13 13:32:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:32:48,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:48,879 INFO L215 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-13 13:32:48,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:32:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:32:49,083 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -187481052, now seen corresponding path program 1 times [2024-11-13 13:32:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561972102] [2024-11-13 13:32:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:50,044 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-13 13:32:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561972102] [2024-11-13 13:32:50,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561972102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147246601] [2024-11-13 13:32:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:50,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:32:50,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:32:50,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:32:50,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:32:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:50,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 13:32:50,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:50,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:32:50,469 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-13 13:32:50,477 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-13 13:32:50,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-13 13:32:50,513 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-13 13:32:50,600 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-13 13:32:50,604 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-13 13:32:50,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:50,726 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-13 13:32:50,732 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-13 13:32:50,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:50,821 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-13 13:32:50,827 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-13 13:32:50,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:50,889 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-13 13:32:50,894 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-13 13:32:50,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:32:50,953 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-13 13:32:50,958 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-13 13:32:50,975 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-13 13:32:50,979 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-13 13:32:51,011 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-13 13:32:51,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:51,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1965 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1965 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-13 13:32:51,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1964) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1963))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1964) .cse1 v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 13:32:51,182 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1963))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1964) .cse1 v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1964) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-13 13:32:51,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1962))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1963))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1961) .cse0 v_ArrVal_1964) .cse1 v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1962))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1961) .cse5 v_ArrVal_1964) (select (select (store .cse6 .cse5 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1965))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:32:51,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1971 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1971))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1962))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1963))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1972) .cse0 v_ArrVal_1961) .cse1 v_ArrVal_1964) .cse2 v_ArrVal_1965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1971 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1971))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1962))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1972) .cse7 v_ArrVal_1961) .cse8 v_ArrVal_1964) (select (select (store .cse9 .cse8 v_ArrVal_1963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1965))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-13 13:32:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147246601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:32:51,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:32:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-13 13:32:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731993854] [2024-11-13 13:32:51,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:32:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:32:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:32:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=685, Unknown=24, NotChecked=290, Total=1122 [2024-11-13 13:32:51,463 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 24 states have internal predecessors, (129), 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-13 13:32:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:55,178 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-13 13:32:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:32:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 24 states have internal predecessors, (129), 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 95 [2024-11-13 13:32:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:55,180 INFO L225 Difference]: With dead ends: 632 [2024-11-13 13:32:55,180 INFO L226 Difference]: Without dead ends: 632 [2024-11-13 13:32:55,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1122, Unknown=25, NotChecked=370, Total=1722 [2024-11-13 13:32:55,181 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 507 mSDsluCounter, 4279 mSDsCounter, 0 mSdLazyCounter, 5279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 4637 SdHoareTripleChecker+Invalid, 5320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 5279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:55,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 4637 Invalid, 5320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 5279 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 13:32:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-13 13:32:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2024-11-13 13:32:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 438 states have (on average 1.5593607305936072) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:32:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-13 13:32:55,190 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 95 [2024-11-13 13:32:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:55,191 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-13 13:32:55,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.863636363636363) internal successors, (129), 24 states have internal predecessors, (129), 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-13 13:32:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-13 13:32:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:32:55,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:55,192 INFO L215 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] [2024-11-13 13:32:55,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:32:55,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:32:55,396 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:55,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1424529729, now seen corresponding path program 1 times [2024-11-13 13:32:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:55,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813115107] [2024-11-13 13:32:55,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:56,211 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-13 13:32:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813115107] [2024-11-13 13:32:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813115107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:56,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:32:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983951684] [2024-11-13 13:32:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:32:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:32:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:32:56,213 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-13 13:32:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:32:57,730 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-13 13:32:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:32:57,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 98 [2024-11-13 13:32:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:32:57,732 INFO L225 Difference]: With dead ends: 637 [2024-11-13 13:32:57,732 INFO L226 Difference]: Without dead ends: 637 [2024-11-13 13:32:57,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:32:57,736 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 536 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:32:57,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2970 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 13:32:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-13 13:32:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-13 13:32:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5416666666666667) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:32:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-13 13:32:57,746 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 98 [2024-11-13 13:32:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:32:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-13 13:32:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-13 13:32:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-13 13:32:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:32:57,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:32:57,747 INFO L215 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] [2024-11-13 13:32:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 13:32:57,748 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:32:57,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:32:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1424529730, now seen corresponding path program 1 times [2024-11-13 13:32:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:32:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481093981] [2024-11-13 13:32:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:32:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:32:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:32:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:32:58,962 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-13 13:32:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:32:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481093981] [2024-11-13 13:32:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481093981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:32:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:32:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:32:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784290814] [2024-11-13 13:32:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:32:58,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:32:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:32:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:32:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:32:58,963 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 13:33:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:01,971 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-13 13:33:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:33:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 98 [2024-11-13 13:33:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:01,974 INFO L225 Difference]: With dead ends: 636 [2024-11-13 13:33:01,974 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 13:33:01,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 13:33:01,975 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 509 mSDsluCounter, 3124 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:01,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3479 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4135 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 13:33:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 13:33:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-13 13:33:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5394736842105263) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:33:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-13 13:33:01,988 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 98 [2024-11-13 13:33:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:01,988 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-13 13:33:01,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 13:33:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-13 13:33:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:33:01,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:01,989 INFO L215 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-13 13:33:01,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 13:33:01,989 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:33:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash 346327909, now seen corresponding path program 1 times [2024-11-13 13:33:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:33:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873618755] [2024-11-13 13:33:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:33:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:33:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:02,786 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-13 13:33:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:33:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873618755] [2024-11-13 13:33:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873618755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435949669] [2024-11-13 13:33:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:33:02,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:33:02,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:33:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:03,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:33:03,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:03,188 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:33:03,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:33:03,220 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-13 13:33:03,310 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-13 13:33:03,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:03,449 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-13 13:33:03,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:03,544 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-13 13:33:03,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:03,610 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-13 13:33:03,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:03,681 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-13 13:33:03,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:03,755 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-13 13:33:03,771 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-13 13:33:03,829 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-13 13:33:03,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-13 13:33:03,864 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-13 13:33:03,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:33:03,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2309 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 13:33:03,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:33:04,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2307 (Array Int Int)) (v_ArrVal_2309 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2307))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2308)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 13:33:04,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2307 (Array Int Int)) (v_ArrVal_2306 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2306))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2307)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2308)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 13:33:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435949669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:04,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:33:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-13 13:33:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788633866] [2024-11-13 13:33:04,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:33:04,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 13:33:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:33:04,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:33:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=785, Unknown=85, NotChecked=252, Total=1260 [2024-11-13 13:33:04,373 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 27 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-13 13:33:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:05,990 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 13:33:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:33:05,991 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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 99 [2024-11-13 13:33:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:05,992 INFO L225 Difference]: With dead ends: 635 [2024-11-13 13:33:05,992 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 13:33:05,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=897, Unknown=87, NotChecked=268, Total=1406 [2024-11-13 13:33:05,993 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 510 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:05,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2931 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:33:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 13:33:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-13 13:33:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 456 states have (on average 1.537280701754386) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:33:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-13 13:33:06,000 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 99 [2024-11-13 13:33:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:06,001 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-13 13:33:06,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-13 13:33:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-13 13:33:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:33:06,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:06,001 INFO L215 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-13 13:33:06,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:33:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:06,203 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:33:06,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 346327910, now seen corresponding path program 1 times [2024-11-13 13:33:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:33:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738376380] [2024-11-13 13:33:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:33:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:33:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:07,367 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-13 13:33:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:33:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738376380] [2024-11-13 13:33:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738376380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626019434] [2024-11-13 13:33:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:07,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:33:07,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:33:07,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:33:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:07,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 13:33:07,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:07,797 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:33:07,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:33:07,806 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-13 13:33:07,844 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-13 13:33:07,849 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-13 13:33:07,982 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-13 13:33:07,986 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-13 13:33:08,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:08,194 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-13 13:33:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 13:33:08,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:08,333 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-13 13:33:08,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-13 13:33:08,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:08,440 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-13 13:33:08,444 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-13 13:33:08,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:08,545 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-13 13:33:08,554 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-13 13:33:08,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:33:08,662 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-13 13:33:08,669 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-13 13:33:08,695 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-13 13:33:08,700 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-13 13:33:08,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:33:08,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:33:08,771 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 13:33:08,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:33:08,774 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-13 13:33:08,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:33:10,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2496))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2498))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse0 v_ArrVal_2497) .cse1 v_ArrVal_2499) (select (select (store .cse2 .cse1 v_ArrVal_2500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2502))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 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_2502 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int))) (or (forall ((v_ArrVal_2503 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2496))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2498))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2500))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2495) .cse5 v_ArrVal_2497) .cse6 v_ArrVal_2499) .cse7 v_ArrVal_2502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2503) (select (select (store .cse8 .cse7 v_ArrVal_2501) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2024-11-13 13:33:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626019434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:33,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:33:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2024-11-13 13:33:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134987407] [2024-11-13 13:33:33,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:33:33,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 13:33:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:33:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 13:33:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1308, Unknown=57, NotChecked=76, Total=1640 [2024-11-13 13:33:33,891 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 29 states, 26 states have (on average 5.230769230769231) internal successors, (136), 28 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-13 13:34:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:10,775 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-13 13:34:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:34:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.230769230769231) internal successors, (136), 28 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 99 [2024-11-13 13:34:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:10,779 INFO L225 Difference]: With dead ends: 634 [2024-11-13 13:34:10,779 INFO L226 Difference]: Without dead ends: 634 [2024-11-13 13:34:10,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=234, Invalid=1602, Unknown=60, NotChecked=84, Total=1980 [2024-11-13 13:34:10,781 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 499 mSDsluCounter, 4558 mSDsCounter, 0 mSdLazyCounter, 6071 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 4911 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:10,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 4911 Invalid, 6096 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6071 Invalid, 0 Unknown, 0 Unchecked, 35.8s Time] [2024-11-13 13:34:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-13 13:34:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 612. [2024-11-13 13:34:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:34:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-13 13:34:10,792 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 99 [2024-11-13 13:34:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:10,792 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-13 13:34:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.230769230769231) internal successors, (136), 28 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-13 13:34:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-13 13:34:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:34:10,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:10,794 INFO L215 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] [2024-11-13 13:34:10,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:34:10,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:10,994 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:34:10,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -406065540, now seen corresponding path program 1 times [2024-11-13 13:34:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523322272] [2024-11-13 13:34:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:34:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:12,897 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-13 13:34:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523322272] [2024-11-13 13:34:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523322272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:34:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931002020] [2024-11-13 13:34:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:34:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:12,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:34:12,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:34:12,899 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 13:34:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:29,543 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-13 13:34:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:34:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2024-11-13 13:34:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:29,547 INFO L225 Difference]: With dead ends: 638 [2024-11-13 13:34:29,547 INFO L226 Difference]: Without dead ends: 638 [2024-11-13 13:34:29,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:34:29,548 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 513 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:29,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3316 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2024-11-13 13:34:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-13 13:34:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2024-11-13 13:34:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5337690631808278) internal successors, (704), 626 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:34:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 731 transitions. [2024-11-13 13:34:29,556 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 731 transitions. Word has length 101 [2024-11-13 13:34:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:29,556 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 731 transitions. [2024-11-13 13:34:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 13:34:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 731 transitions. [2024-11-13 13:34:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:34:29,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:29,557 INFO L215 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] [2024-11-13 13:34:29,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 13:34:29,557 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:34:29,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash -406065539, now seen corresponding path program 1 times [2024-11-13 13:34:29,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:29,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307987359] [2024-11-13 13:34:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:34:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:33,443 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-13 13:34:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307987359] [2024-11-13 13:34:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307987359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:34:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581516425] [2024-11-13 13:34:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:33,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:34:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:34:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:34:33,445 INFO L87 Difference]: Start difference. First operand 634 states and 731 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 13:34:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:52,073 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-13 13:34:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:34:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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 101 [2024-11-13 13:34:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:52,075 INFO L225 Difference]: With dead ends: 637 [2024-11-13 13:34:52,075 INFO L226 Difference]: Without dead ends: 637 [2024-11-13 13:34:52,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-13 13:34:52,076 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 511 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:52,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2674 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-13 13:34:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-13 13:34:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-13 13:34:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5315904139433552) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:34:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-13 13:34:52,088 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 101 [2024-11-13 13:34:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:52,088 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-13 13:34:52,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 13:34:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-13 13:34:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:34:52,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:52,089 INFO L215 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-13 13:34:52,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 13:34:52,090 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:34:52,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash 943921624, now seen corresponding path program 1 times [2024-11-13 13:34:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224832980] [2024-11-13 13:34:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:34:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:53,018 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-13 13:34:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:53,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224832980] [2024-11-13 13:34:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224832980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:34:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501591558] [2024-11-13 13:34:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:34:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:34:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:34:53,020 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 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-13 13:34:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:57,896 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-13 13:34:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:34:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 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-13 13:34:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:57,899 INFO L225 Difference]: With dead ends: 636 [2024-11-13 13:34:57,899 INFO L226 Difference]: Without dead ends: 636 [2024-11-13 13:34:57,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:34:57,899 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 12 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:57,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2099 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-13 13:34:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-13 13:34:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-13 13:34:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 459 states have (on average 1.5294117647058822) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:34:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-13 13:34:57,906 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 102 [2024-11-13 13:34:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:57,907 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-13 13:34:57,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 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-13 13:34:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-13 13:34:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 13:34:57,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:57,908 INFO L215 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-13 13:34:57,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 13:34:57,908 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:34:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 943921625, now seen corresponding path program 1 times [2024-11-13 13:34:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890810142] [2024-11-13 13:34:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:35:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,915 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-13 13:35:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890810142] [2024-11-13 13:35:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890810142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187613158] [2024-11-13 13:35:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:01,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:01,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:01,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:35:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:02,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 13:35:02,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:03,003 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-13 13:35:03,130 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:35:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:35:03,406 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-13 13:35:03,451 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-13 13:35:04,246 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-13 13:35:04,261 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-13 13:35:05,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:05,531 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-13 13:35:05,590 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-13 13:35:06,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:06,370 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-13 13:35:06,426 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-13 13:35:07,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:07,016 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-13 13:35:07,056 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-13 13:35:07,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:07,573 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-13 13:35:07,609 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-13 13:35:08,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:08,157 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-13 13:35:08,199 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-13 13:35:08,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:35:08,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 13:35:08,881 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-13 13:35:08,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-13 13:35:09,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:35:09,279 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-13 13:35:09,308 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-13 13:35:09,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:35:09,619 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-13 13:35:10,001 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-13 13:35:10,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:10,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2976 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 13:35:11,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2973) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2974))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2973) .cse1 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse2 .cse1 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-13 13:35:12,461 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_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2972))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971) .cse0 v_ArrVal_2973) (select (select (store .cse1 .cse0 v_ArrVal_2974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2976))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 40)))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int))) (or (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2972))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2974))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2971) .cse3 v_ArrVal_2973) .cse4 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse5 .cse4 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))))) is different from false [2024-11-13 13:35:13,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2970))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2972))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969) .cse0 v_ArrVal_2971) .cse1 v_ArrVal_2973) (select (select (store .cse2 .cse1 v_ArrVal_2974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2976))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2970))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2972))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2974))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2969) .cse5 v_ArrVal_2971) .cse6 v_ArrVal_2973) .cse7 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse8 .cse7 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-13 13:35:54,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2982))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2968))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2970))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2972))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2983) .cse0 v_ArrVal_2967) .cse1 v_ArrVal_2969) .cse2 v_ArrVal_2971) .cse3 v_ArrVal_2973) (select (select (store .cse4 .cse3 v_ArrVal_2974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2976))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 40)))) (forall ((v_ArrVal_2968 (Array Int Int)) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_ArrVal_2973 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2972 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2975 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2982))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2968))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2970))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2972))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2974))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2983) .cse9 v_ArrVal_2967) .cse10 v_ArrVal_2969) .cse11 v_ArrVal_2971) .cse12 v_ArrVal_2973) .cse13 v_ArrVal_2976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2975) (select (select (store .cse14 .cse13 v_ArrVal_2977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))))) is different from false [2024-11-13 13:35:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187613158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:54,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:35:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2024-11-13 13:35:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110071406] [2024-11-13 13:35:54,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:35:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:35:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1448, Unknown=51, NotChecked=420, Total=2162 [2024-11-13 13:35:54,823 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 33 states, 30 states have (on average 4.766666666666667) internal successors, (143), 32 states have internal predecessors, (143), 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-13 13:37:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:37:10,323 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-13 13:37:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:37:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.766666666666667) internal successors, (143), 32 states have internal predecessors, (143), 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 102 [2024-11-13 13:37:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:37:10,326 INFO L225 Difference]: With dead ends: 635 [2024-11-13 13:37:10,326 INFO L226 Difference]: Without dead ends: 635 [2024-11-13 13:37:10,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=404, Invalid=2427, Unknown=51, NotChecked=540, Total=3422 [2024-11-13 13:37:10,327 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 501 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 5884 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:37:10,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 5130 Invalid, 5916 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 5884 Invalid, 0 Unknown, 0 Unchecked, 69.5s Time] [2024-11-13 13:37:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-13 13:37:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 610. [2024-11-13 13:37:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 438 states have (on average 1.5502283105022832) internal successors, (679), 603 states have internal predecessors, (679), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:37:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 705 transitions. [2024-11-13 13:37:10,334 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 705 transitions. Word has length 102 [2024-11-13 13:37:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:37:10,334 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 705 transitions. [2024-11-13 13:37:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.766666666666667) internal successors, (143), 32 states have internal predecessors, (143), 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-13 13:37:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 705 transitions. [2024-11-13 13:37:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 13:37:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:37:10,335 INFO L215 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] [2024-11-13 13:37:10,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:37:10,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 13:37:10,536 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:37:10,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:37:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1825007240, now seen corresponding path program 1 times [2024-11-13 13:37:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:37:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147027523] [2024-11-13 13:37:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:37:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:37:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:14,559 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-13 13:37:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:37:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147027523] [2024-11-13 13:37:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147027523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:37:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:37:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:37:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005141226] [2024-11-13 13:37:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:37:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:37:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:37:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:37:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:37:14,561 INFO L87 Difference]: Start difference. First operand 610 states and 705 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 13:37:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:37:55,493 INFO L93 Difference]: Finished difference Result 661 states and 761 transitions. [2024-11-13 13:37:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:37:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2024-11-13 13:37:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:37:55,496 INFO L225 Difference]: With dead ends: 661 [2024-11-13 13:37:55,496 INFO L226 Difference]: Without dead ends: 661 [2024-11-13 13:37:55,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:37:55,497 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 596 mSDsluCounter, 3927 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:37:55,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 4282 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3262 Invalid, 0 Unknown, 0 Unchecked, 38.6s Time] [2024-11-13 13:37:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-13 13:37:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 635. [2024-11-13 13:37:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 462 states have (on average 1.525974025974026) internal successors, (705), 627 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:37:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2024-11-13 13:37:55,506 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 104 [2024-11-13 13:37:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:37:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2024-11-13 13:37:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 13:37:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2024-11-13 13:37:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 13:37:55,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:37:55,508 INFO L215 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] [2024-11-13 13:37:55,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 13:37:55,508 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:37:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:37:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1825007241, now seen corresponding path program 1 times [2024-11-13 13:37:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:37:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254746267] [2024-11-13 13:37:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:37:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:00,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:38:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:00,687 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-13 13:38:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:38:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254746267] [2024-11-13 13:38:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254746267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:38:00,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:38:00,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:38:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425327618] [2024-11-13 13:38:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:38:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:38:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:38:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:38:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:38:00,689 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 13:38:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:38:37,206 INFO L93 Difference]: Finished difference Result 660 states and 760 transitions. [2024-11-13 13:38:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:38:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2024-11-13 13:38:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:38:37,209 INFO L225 Difference]: With dead ends: 660 [2024-11-13 13:38:37,209 INFO L226 Difference]: Without dead ends: 660 [2024-11-13 13:38:37,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:38:37,209 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 592 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 3498 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:38:37,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 3498 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 34.0s Time] [2024-11-13 13:38:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-13 13:38:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 635. [2024-11-13 13:38:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 462 states have (on average 1.5238095238095237) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:38:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-13 13:38:37,228 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 104 [2024-11-13 13:38:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:38:37,228 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-13 13:38:37,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 13:38:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-13 13:38:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 13:38:37,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:38:37,229 INFO L215 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-13 13:38:37,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 13:38:37,229 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:38:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:38:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1218850220, now seen corresponding path program 1 times [2024-11-13 13:38:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:38:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090693401] [2024-11-13 13:38:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:38:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:38:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:38:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:38:43,823 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-13 13:38:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:38:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090693401] [2024-11-13 13:38:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090693401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:38:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:38:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:38:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795785887] [2024-11-13 13:38:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:38:43,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:38:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:38:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:38:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:38:43,825 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 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-13 13:39:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:39:21,071 INFO L93 Difference]: Finished difference Result 651 states and 749 transitions. [2024-11-13 13:39:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:39:21,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 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-13 13:39:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:39:21,074 INFO L225 Difference]: With dead ends: 651 [2024-11-13 13:39:21,074 INFO L226 Difference]: Without dead ends: 651 [2024-11-13 13:39:21,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:39:21,075 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1057 mSDsluCounter, 3568 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:39:21,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 3927 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2897 Invalid, 0 Unknown, 0 Unchecked, 34.1s Time] [2024-11-13 13:39:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-13 13:39:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 634. [2024-11-13 13:39:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 462 states have (on average 1.5216450216450217) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:39:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2024-11-13 13:39:21,086 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 105 [2024-11-13 13:39:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:39:21,087 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2024-11-13 13:39:21,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 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-13 13:39:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2024-11-13 13:39:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 13:39:21,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:39:21,088 INFO L215 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-13 13:39:21,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 13:39:21,089 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:39:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:39:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1218850221, now seen corresponding path program 1 times [2024-11-13 13:39:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:39:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134864805] [2024-11-13 13:39:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:39:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:39:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:26,710 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-13 13:39:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:39:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134864805] [2024-11-13 13:39:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134864805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:39:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064484682] [2024-11-13 13:39:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:26,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:39:26,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:39:26,713 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:39:26,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:39:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:27,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:39:27,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:39:28,660 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:39:28,661 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-13 13:39:29,066 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-13 13:39:29,090 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-13 13:39:30,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:30,504 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-13 13:39:30,529 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-13 13:39:31,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:31,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-13 13:39:31,262 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-13 13:39:32,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:32,011 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-13 13:39:32,044 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-13 13:39:32,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:32,795 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-13 13:39:32,827 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-13 13:39:33,614 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:33,614 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-13 13:39:33,639 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-13 13:39:34,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39: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 51 treesize of output 48 [2024-11-13 13:39:34,529 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-13 13:39:35,410 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:39:35,410 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 70 treesize of output 65 [2024-11-13 13:39:35,437 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 49 treesize of output 30 [2024-11-13 13:39:36,123 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 39 treesize of output 21 [2024-11-13 13:39:36,147 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 32 treesize of output 14 [2024-11-13 13:39:36,615 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-13 13:39:36,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:39:37,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:39:37,767 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 46 treesize of output 50 [2024-11-13 13:39:38,943 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3480 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_39 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3479 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 13:39:39,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3477) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3477))) (< (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3478))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= (select (select (store .cse2 .cse3 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) .cse3)))))) is different from false [2024-11-13 13:39:39,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3478))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3477))) (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3477) (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:39:39,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3476))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3475) .cse0 v_ArrVal_3477) (select (select (store .cse1 .cse0 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3476))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3478)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse3 .cse4 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse4)))) (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3476))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3475) .cse8 v_ArrVal_3477))) (< (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 41)))))))) is different from false [2024-11-13 13:39:39,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3476))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_3475) .cse2 v_ArrVal_3477))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 41)))))) (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3476))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_3475) .cse5 v_ArrVal_3477) (select (select (store .cse6 .cse5 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_3476))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3478)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-11-13 13:39:39,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3474))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse5 .cse4 v_ArrVal_3476))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3473) .cse4 v_ArrVal_3475) .cse2 v_ArrVal_3477))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3474))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3476)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3478)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse6 (select (select (store .cse7 .cse6 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3474))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3476))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3473) .cse10 v_ArrVal_3475) .cse11 v_ArrVal_3477) (select (select (store .cse12 .cse11 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-13 13:39:40,104 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3474))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3476))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3473) .cse1 v_ArrVal_3475) .cse2 v_ArrVal_3477) (select (select (store .cse3 .cse2 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_39))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3474))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3476)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3478)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= .cse6 (select (select (store .cse7 .cse6 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3474))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_3476))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3473) .cse13 v_ArrVal_3475) .cse12 v_ArrVal_3477))) (< (select (select (store .cse10 (select (select (store .cse11 .cse12 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 41))))))))))) is different from false [2024-11-13 13:39:41,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3472))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3474)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3476)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3478)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3472))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3474))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_3476))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3471) .cse9 v_ArrVal_3473) .cse10 v_ArrVal_3475) .cse8 v_ArrVal_3477))) (< (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))) (forall ((v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3472))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3474))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3476))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3471) .cse13 v_ArrVal_3473) .cse14 v_ArrVal_3475) .cse15 v_ArrVal_3477) (select (select (store .cse16 .cse15 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 13:39:46,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse6 v_ArrVal_3472))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3474)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3476)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3478)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse6 v_ArrVal_3472))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3474))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3476))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse6 v_ArrVal_3471) .cse7 v_ArrVal_3473) .cse8 v_ArrVal_3475) .cse9 v_ArrVal_3477) (select (select (store .cse10 .cse9 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#0.base| .cse6 v_ArrVal_3472))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_3474))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse18 .cse17 v_ArrVal_3476))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse6 v_ArrVal_3471) .cse16 v_ArrVal_3473) .cse17 v_ArrVal_3475) .cse15 v_ArrVal_3477))) (< (select (select (store .cse13 (select (select (store .cse14 .cse15 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))))) is different from false [2024-11-13 13:39:51,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int)) (v_ArrVal_3469 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3470))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_3472))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3474))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_3476))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3469) .cse4 v_ArrVal_3471) .cse5 v_ArrVal_3473) .cse6 v_ArrVal_3475) .cse2 v_ArrVal_3477))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 41 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3469 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3470))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3472))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3474))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3476))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3469) .cse10 v_ArrVal_3471) .cse11 v_ArrVal_3473) .cse12 v_ArrVal_3475) .cse13 v_ArrVal_3477) (select (select (store .cse14 .cse13 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3470))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3472)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3474)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3476)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3478)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse18 .cse19 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse19)))))) is different from false [2024-11-13 13:39:56,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse7 v_ArrVal_3470))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3472)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3474)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3476)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3478)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3469 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#0.base| .cse7 v_ArrVal_3470))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3472))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3474))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3476))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse7 v_ArrVal_3469) .cse8 v_ArrVal_3471) .cse9 v_ArrVal_3473) .cse10 v_ArrVal_3475) .cse11 v_ArrVal_3477) (select (select (store .cse12 .cse11 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_39))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int)) (v_ArrVal_3469 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#0.base| .cse7 v_ArrVal_3470))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_3472))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_3474))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse22 .cse21 v_ArrVal_3476))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse7 v_ArrVal_3469) .cse19 v_ArrVal_3471) .cse20 v_ArrVal_3473) .cse21 v_ArrVal_3475) .cse18 v_ArrVal_3477))) (< (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 41 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))))))) is different from false [2024-11-13 13:40:02,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3486 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3479 (Array Int Int)) (v_ArrVal_3469 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3485))) (let ((.cse4 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse4 v_ArrVal_3470))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3472))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3474))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse8 .cse7 v_ArrVal_3476))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3486) .cse4 v_ArrVal_3469) .cse5 v_ArrVal_3471) .cse6 v_ArrVal_3473) .cse7 v_ArrVal_3475) .cse2 v_ArrVal_3477))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 41)))))))))))))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3480 (Array Int Int))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3485))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3470)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3472)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3474)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3476)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3478)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse12 (select (select (store .cse13 .cse12 v_ArrVal_3480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3470 (Array Int Int)) (v_ArrVal_3471 (Array Int Int)) (v_ArrVal_3472 (Array Int Int)) (v_ArrVal_3473 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3486 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3469 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3485))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3470))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3472))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3474))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3476))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3486) .cse19 v_ArrVal_3469) .cse20 v_ArrVal_3471) .cse21 v_ArrVal_3473) .cse22 v_ArrVal_3475) .cse23 v_ArrVal_3477) (select (select (store .cse24 .cse23 v_ArrVal_3478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_39))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-13 13:40:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064484682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:40:02,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:40:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2024-11-13 13:40:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965261744] [2024-11-13 13:40:02,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:40:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:40:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:40:02,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:40:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=954, Unknown=25, NotChecked=876, Total=1980 [2024-11-13 13:40:02,495 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:41:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:01,273 INFO L93 Difference]: Finished difference Result 650 states and 748 transitions. [2024-11-13 13:41:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:41:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2024-11-13 13:41:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:01,276 INFO L225 Difference]: With dead ends: 650 [2024-11-13 13:41:01,276 INFO L226 Difference]: Without dead ends: 650 [2024-11-13 13:41:01,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=214, Invalid=1701, Unknown=25, NotChecked=1140, Total=3080 [2024-11-13 13:41:01,278 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 574 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 3766 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 3808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:01,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 4152 Invalid, 3808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3766 Invalid, 0 Unknown, 0 Unchecked, 53.3s Time] [2024-11-13 13:41:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-13 13:41:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 608. [2024-11-13 13:41:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 438 states have (on average 1.5456621004566211) internal successors, (677), 601 states have internal predecessors, (677), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:41:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 703 transitions. [2024-11-13 13:41:01,287 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 703 transitions. Word has length 105 [2024-11-13 13:41:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 703 transitions. [2024-11-13 13:41:01,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.37037037037037) internal successors, (145), 29 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:41:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 703 transitions. [2024-11-13 13:41:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:41:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:01,289 INFO L215 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, 1] [2024-11-13 13:41:01,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:41:01,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 13:41:01,490 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:41:01,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1199656816, now seen corresponding path program 1 times [2024-11-13 13:41:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:01,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611247582] [2024-11-13 13:41:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:41:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:02,103 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-13 13:41:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611247582] [2024-11-13 13:41:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611247582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:41:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946931849] [2024-11-13 13:41:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:41:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:41:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:41:02,105 INFO L87 Difference]: Start difference. First operand 608 states and 703 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 13:41:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:13,793 INFO L93 Difference]: Finished difference Result 627 states and 725 transitions. [2024-11-13 13:41:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:41:13,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 107 [2024-11-13 13:41:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:13,795 INFO L225 Difference]: With dead ends: 627 [2024-11-13 13:41:13,795 INFO L226 Difference]: Without dead ends: 627 [2024-11-13 13:41:13,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:41:13,796 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 28 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:13,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2059 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-13 13:41:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-13 13:41:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 607. [2024-11-13 13:41:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 438 states have (on average 1.54337899543379) internal successors, (676), 600 states have internal predecessors, (676), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 13:41:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 702 transitions. [2024-11-13 13:41:13,803 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 702 transitions. Word has length 107 [2024-11-13 13:41:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 702 transitions. [2024-11-13 13:41:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 13:41:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 702 transitions. [2024-11-13 13:41:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:41:13,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:13,804 INFO L215 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, 1] [2024-11-13 13:41:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 13:41:13,804 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:41:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1199656815, now seen corresponding path program 1 times [2024-11-13 13:41:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120357785] [2024-11-13 13:41:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:41:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:20,290 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-13 13:41:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120357785] [2024-11-13 13:41:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120357785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:41:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652967851] [2024-11-13 13:41:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:41:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:41:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:41:20,292 INFO L87 Difference]: Start difference. First operand 607 states and 702 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-13 13:42:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:42:16,479 INFO L93 Difference]: Finished difference Result 655 states and 755 transitions. [2024-11-13 13:42:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:42:16,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 107 [2024-11-13 13:42:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:42:16,482 INFO L225 Difference]: With dead ends: 655 [2024-11-13 13:42:16,482 INFO L226 Difference]: Without dead ends: 655 [2024-11-13 13:42:16,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-13 13:42:16,483 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 605 mSDsluCounter, 4017 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 4368 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:42:16,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 4368 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 52.7s Time] [2024-11-13 13:42:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-13 13:42:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 635. [2024-11-13 13:42:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 465 states have (on average 1.5139784946236559) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 13:42:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2024-11-13 13:42:16,491 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 107 [2024-11-13 13:42:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:42:16,491 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2024-11-13 13:42:16,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-13 13:42:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2024-11-13 13:42:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:42:16,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:42:16,492 INFO L215 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, 1, 1] [2024-11-13 13:42:16,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 13:42:16,492 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:42:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1465345036, now seen corresponding path program 1 times [2024-11-13 13:42:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:42:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295048487] [2024-11-13 13:42:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:42:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:42:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:24,028 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-13 13:42:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:42:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295048487] [2024-11-13 13:42:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295048487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:42:24,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:42:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 13:42:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065563346] [2024-11-13 13:42:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:42:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:42:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:42:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:42:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:42:24,030 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-13 13:43:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:43:07,071 INFO L93 Difference]: Finished difference Result 655 states and 755 transitions. [2024-11-13 13:43:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:43:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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 108 [2024-11-13 13:43:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:43:07,074 INFO L225 Difference]: With dead ends: 655 [2024-11-13 13:43:07,074 INFO L226 Difference]: Without dead ends: 655 [2024-11-13 13:43:07,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 13:43:07,075 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 606 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:43:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 3321 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 38.7s Time] [2024-11-13 13:43:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-13 13:43:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 636. [2024-11-13 13:43:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 466 states have (on average 1.5128755364806867) internal successors, (705), 628 states have internal predecessors, (705), 14 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (15), 5 states have call predecessors, (15), 14 states have call successors, (15) [2024-11-13 13:43:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 734 transitions. [2024-11-13 13:43:07,087 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 734 transitions. Word has length 108 [2024-11-13 13:43:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:43:07,088 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 734 transitions. [2024-11-13 13:43:07,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-13 13:43:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 734 transitions. [2024-11-13 13:43:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:43:07,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:43:07,089 INFO L215 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, 1, 1] [2024-11-13 13:43:07,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 13:43:07,090 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:43:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1465345037, now seen corresponding path program 1 times [2024-11-13 13:43:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:43:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988712888] [2024-11-13 13:43:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:43:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:43:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:16,330 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-13 13:43:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:43:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988712888] [2024-11-13 13:43:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988712888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:43:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:43:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 13:43:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303362456] [2024-11-13 13:43:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:43:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:43:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:43:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:43:16,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:43:16,338 INFO L87 Difference]: Start difference. First operand 636 states and 734 transitions. Second operand has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-13 13:44:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:44:18,144 INFO L93 Difference]: Finished difference Result 654 states and 754 transitions. [2024-11-13 13:44:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:44:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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 108 [2024-11-13 13:44:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:44:18,148 INFO L225 Difference]: With dead ends: 654 [2024-11-13 13:44:18,148 INFO L226 Difference]: Without dead ends: 654 [2024-11-13 13:44:18,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 13:44:18,149 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 582 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:44:18,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3865 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 56.9s Time] [2024-11-13 13:44:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-13 13:44:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 636. [2024-11-13 13:44:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 465 states have (on average 1.5139784946236559) internal successors, (704), 628 states have internal predecessors, (704), 14 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (15), 5 states have call predecessors, (15), 14 states have call successors, (15) [2024-11-13 13:44:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 733 transitions. [2024-11-13 13:44:18,160 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 733 transitions. Word has length 108 [2024-11-13 13:44:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:44:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 733 transitions. [2024-11-13 13:44:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-13 13:44:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 733 transitions. [2024-11-13 13:44:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:44:18,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:44:18,161 INFO L215 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, 1, 1] [2024-11-13 13:44:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 13:44:18,161 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:44:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1114040045, now seen corresponding path program 1 times [2024-11-13 13:44:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:44:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30080354] [2024-11-13 13:44:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:44:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:44:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:19,039 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-13 13:44:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:44:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30080354] [2024-11-13 13:44:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30080354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:44:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:44:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:44:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505109233] [2024-11-13 13:44:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:44:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:44:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:44:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:44:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:44:19,041 INFO L87 Difference]: Start difference. First operand 636 states and 733 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-13 13:44:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:44:31,217 INFO L93 Difference]: Finished difference Result 652 states and 752 transitions. [2024-11-13 13:44:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:44:31,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 108 [2024-11-13 13:44:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:44:31,220 INFO L225 Difference]: With dead ends: 652 [2024-11-13 13:44:31,220 INFO L226 Difference]: Without dead ends: 652 [2024-11-13 13:44:31,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:44:31,221 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 27 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:44:31,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2064 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2024-11-13 13:44:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-13 13:44:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 635. [2024-11-13 13:44:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 465 states have (on average 1.5118279569892472) internal successors, (703), 627 states have internal predecessors, (703), 14 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (15), 5 states have call predecessors, (15), 14 states have call successors, (15) [2024-11-13 13:44:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2024-11-13 13:44:31,234 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 108 [2024-11-13 13:44:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:44:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2024-11-13 13:44:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-13 13:44:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2024-11-13 13:44:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:44:31,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:44:31,238 INFO L215 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, 1, 1, 1] [2024-11-13 13:44:31,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 13:44:31,238 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:44:31,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash 175503664, now seen corresponding path program 1 times [2024-11-13 13:44:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:44:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998814329] [2024-11-13 13:44:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:44:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:44:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:40,170 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-13 13:44:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:44:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998814329] [2024-11-13 13:44:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998814329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:44:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489099576] [2024-11-13 13:44:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:44:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:44:40,174 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:44:40,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:44:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:40,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 13:44:40,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:44:42,542 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:44:42,542 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-13 13:44:42,617 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-13 13:44:42,683 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-13 13:44:44,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:44:44,125 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-13 13:44:44,156 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-13 13:44:45,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:44:45,132 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-13 13:44:45,164 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-13 13:44:46,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:44:46,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 51 treesize of output 48 [2024-11-13 13:44:46,249 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-13 13:44:47,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:44:47,273 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-13 13:44:47,303 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-13 13:44:48,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:44:48,333 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-13 13:44:48,364 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-13 13:44:48,631 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-13 13:44:49,024 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-13 13:44:49,024 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 79 treesize of output 45 [2024-11-13 13:44:49,056 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-13 13:44:50,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:44:50,489 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-13 13:44:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 52 [2024-11-13 13:44:50,520 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-13 13:44:51,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 13:44:51,770 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 13:44:51,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-13 13:44:51,799 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-13 13:44:51,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:44:52,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int))) (or (not (= (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse0 (select v_ArrVal_4164 .cse0))) v_ArrVal_4164)) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4164))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-11-13 13:44:52,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_4164))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4164 (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select |c_#memory_$Pointer$#0.base| .cse2) .cse3 (select v_ArrVal_4164 .cse3))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 13:44:52,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4161))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4164 .cse2))) v_ArrVal_4164)) (= (select |c_#valid| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4164))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-13 13:44:52,631 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 272 treesize of output 184 [2024-11-13 13:44:52,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4161)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4164 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4164 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4164))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))))) is different from false [2024-11-13 13:44:53,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse6 (store (select |c_#memory_$Pointer$#0.base| .cse6) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| .cse6 v_ArrVal_4161)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4164 .cse2))) v_ArrVal_4164)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4164))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))) is different from false [2024-11-13 13:44:53,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4158)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4159))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4161)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4164))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4164 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4164 .cse5))))))))))) is different from false [2024-11-13 13:44:54,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_4159))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4161)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4164))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4164 .cse5))) v_ArrVal_4164)))))))))) is different from false [2024-11-13 13:44:55,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4156)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4157) .cse9 v_ArrVal_4159))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4161))) (or (not (= v_ArrVal_4164 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4164 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_14| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4164))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-13 13:44:55,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_4156))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_4157) .cse10 v_ArrVal_4159))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4164))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (not (= v_ArrVal_4164 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4164 .cse5))))))))))))))) is different from false [2024-11-13 13:44:56,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4154 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4155 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4155)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4156))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4154) .cse9 v_ArrVal_4157) .cse10 v_ArrVal_4159))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4164))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4164 .cse5))) v_ArrVal_4164)))))))))))) is different from false [2024-11-13 13:44:56,359 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4154 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4155 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4161 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_4155))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4156))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_4154) .cse10 v_ArrVal_4157) .cse11 v_ArrVal_4159))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4164))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4164 .cse5))) v_ArrVal_4164)))))))))))))) is different from false [2024-11-13 13:44:56,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4152 (Array Int Int)) (v_ArrVal_4153 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4154 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4155 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4152)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4155))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4156))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4153) .cse9 v_ArrVal_4154) .cse10 v_ArrVal_4157) .cse11 v_ArrVal_4159))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4164 .cse4))) v_ArrVal_4164)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4164))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))))))))))))) is different from false [2024-11-13 13:44:57,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4152 (Array Int Int)) (v_ArrVal_4153 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4154 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4155 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_4152))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4155))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4156))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_4153) .cse10 v_ArrVal_4154) .cse11 v_ArrVal_4157) .cse12 v_ArrVal_4159))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4164))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|) (not (= v_ArrVal_4164 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4164 .cse5))))))))))))))))))) is different from false [2024-11-13 13:44:58,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_14| Int) (v_ArrVal_4170 (Array Int Int)) (v_ArrVal_4171 (Array Int Int)) (v_ArrVal_4161 (Array Int Int)) (v_ArrVal_4152 (Array Int Int)) (v_ArrVal_4153 (Array Int Int)) (v_ArrVal_4164 (Array Int Int)) (v_ArrVal_4154 (Array Int Int)) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4155 (Array Int Int)) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4157 (Array Int Int)) (v_ArrVal_4158 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4170)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4152))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4155))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4156))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4158))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4171) .cse9 v_ArrVal_4153) .cse10 v_ArrVal_4154) .cse11 v_ArrVal_4157) .cse12 v_ArrVal_4159))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4161)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4164 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4164 .cse4))))) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4164))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_14|))))))))))))))) is different from false [2024-11-13 13:44:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489099576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:44:58,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:44:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 28 [2024-11-13 13:44:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865105758] [2024-11-13 13:44:58,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:44:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 13:44:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:44:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 13:44:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=740, Unknown=14, NotChecked=938, Total=1806 [2024-11-13 13:44:58,329 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 29 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 28 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:45:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:45:51,227 INFO L93 Difference]: Finished difference Result 651 states and 751 transitions. [2024-11-13 13:45:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:45:51,228 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 28 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-13 13:45:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:45:51,231 INFO L225 Difference]: With dead ends: 651 [2024-11-13 13:45:51,231 INFO L226 Difference]: Without dead ends: 651 [2024-11-13 13:45:51,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=212, Invalid=1636, Unknown=14, NotChecked=1330, Total=3192 [2024-11-13 13:45:51,233 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 550 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:45:51,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 4227 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 47.6s Time] [2024-11-13 13:45:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-13 13:45:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 634. [2024-11-13 13:45:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 465 states have (on average 1.5096774193548388) internal successors, (702), 626 states have internal predecessors, (702), 14 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (15), 5 states have call predecessors, (15), 14 states have call successors, (15) [2024-11-13 13:45:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 731 transitions. [2024-11-13 13:45:51,244 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 731 transitions. Word has length 109 [2024-11-13 13:45:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:45:51,244 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 731 transitions. [2024-11-13 13:45:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 28 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:45:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 731 transitions. [2024-11-13 13:45:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:45:51,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:45:51,245 INFO L215 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, 1, 1, 1] [2024-11-13 13:45:51,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:45:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:45:51,446 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-13 13:45:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:45:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash 175503665, now seen corresponding path program 1 times [2024-11-13 13:45:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:45:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676663433] [2024-11-13 13:45:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:45:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:45:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:46:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,038 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-13 13:46:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:46:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676663433] [2024-11-13 13:46:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676663433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:46:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683917178] [2024-11-13 13:46:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:46:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:46:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:46:02,040 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:46:02,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade32c3a-c00f-4960-833e-31fa152d9a14/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:46:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:46:02,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-13 13:46:02,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:46:04,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:46:04,329 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-13 13:46:04,827 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-13 13:46:04,856 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-13 13:46:06,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:46:06,392 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-13 13:46:06,421 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 20 treesize of output 1 [2024-11-13 13:46:07,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:46:07,247 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-13 13:46:07,276 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 20 treesize of output 1 [2024-11-13 13:46:08,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:46:08,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 51 treesize of output 48 [2024-11-13 13:46:08,139 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 20 treesize of output 1 [2024-11-13 13:46:09,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:46:09,008 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-13 13:46:09,037 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 20 treesize of output 1 [2024-11-13 13:46:09,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:46:09,926 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-13 13:46:09,954 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 20 treesize of output 1 [2024-11-13 13:46:10,841 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-13 13:46:11,910 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 13:46:11,911 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 106 treesize of output 72 [2024-11-13 13:46:11,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 13:46:13,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:46:14,050 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 13:46:14,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-13 13:46:14,244 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 13:46:14,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-13 13:46:15,634 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 13:46:15,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-13 13:46:15,699 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-13 13:46:15,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:46:18,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (and (forall ((v_ArrVal_4388 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4388 .cse1)) v_ArrVal_4388)) (forall ((v_ArrVal_4387 (Array Int Int))) (or (< 0 (+ (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4388))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= v_ArrVal_4387 (store .cse4 .cse1 (select v_ArrVal_4387 .cse1)))))))) (forall ((v_ArrVal_4388 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4388 .cse1)) v_ArrVal_4388)) (forall ((v_ArrVal_4387 (Array Int Int))) (or (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4388)) (.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4387))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= v_ArrVal_4387 (store .cse4 .cse1 (select v_ArrVal_4387 .cse1)))))))))) is different from false [2024-11-13 13:46:18,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| .cse8)) (.cse2 (select |c_#memory_$Pointer$#0.base| .cse8)) (.cse9 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (forall ((v_ArrVal_4388 (Array Int Int))) (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (not (= v_ArrVal_4388 (store .cse0 .cse1 (select v_ArrVal_4388 .cse1)))) (forall ((v_ArrVal_4387 (Array Int Int))) (or (not (= v_ArrVal_4387 (store .cse2 .cse1 (select v_ArrVal_4387 .cse1)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| .cse8 v_ArrVal_4388)) (.cse6 (store |c_#memory_$Pointer$#0.base| .cse8 v_ArrVal_4387))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (< (+ (select (select .cse3 .cse4) .cse5) 383) (select |c_#length| (select (select .cse6 .cse4) .cse5)))))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (forall ((v_ArrVal_4388 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (not (= v_ArrVal_4388 (store .cse0 .cse10 (select v_ArrVal_4388 .cse10)))) (forall ((v_ArrVal_4387 (Array Int Int))) (or (not (= v_ArrVal_4387 (store .cse2 .cse10 (select v_ArrVal_4387 .cse10)))) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse8 v_ArrVal_4388))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#0.base| .cse8 v_ArrVal_4387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse9))))))) is different from false [2024-11-13 13:46:19,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse8 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse1 (select .cse8 .cse6)) (.cse3 (select .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse0) (forall ((v_ArrVal_4388 (Array Int Int))) (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_4388 .cse2)) v_ArrVal_4388)) (forall ((v_ArrVal_4387 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_4387 .cse2)) v_ArrVal_4387)) (< 0 (+ (let ((.cse4 (store .cse8 .cse6 v_ArrVal_4388))) (select (select .cse4 (select (select (store .cse5 .cse6 v_ArrVal_4387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) 1))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse0) (forall ((v_ArrVal_4388 (Array Int Int))) (let ((.cse9 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (not (= (store .cse1 .cse9 (select v_ArrVal_4388 .cse9)) v_ArrVal_4388)) (forall ((v_ArrVal_4387 (Array Int Int))) (or (let ((.cse10 (store .cse8 .cse6 v_ArrVal_4388)) (.cse13 (store .cse5 .cse6 v_ArrVal_4387))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (< (+ 383 (select (select .cse10 .cse11) .cse12)) (select |c_#length| (select (select .cse13 .cse11) .cse12))))) (not (= (store .cse3 .cse9 (select v_ArrVal_4387 .cse9)) v_ArrVal_4387))))))))))))) is different from false [2024-11-13 13:46:19,927 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 757 treesize of output 664 [2024-11-13 13:46:22,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4388 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_17| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_17|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_17| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4387))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4388) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse5) (not (= v_ArrVal_4387 (store (select .cse2 .cse3) .cse6 (select v_ArrVal_4387 .cse6)))) (not (= (store (select .cse4 .cse3) .cse6 (select v_ArrVal_4388 .cse6)) v_ArrVal_4388)))))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4388 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_17| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_17|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse11 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse5) (< (let ((.cse8 (store .cse4 .cse10 v_ArrVal_4388))) (select (select .cse8 (select (select (store .cse9 .cse10 v_ArrVal_4387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4387 (store (select .cse9 .cse10) .cse11 (select v_ArrVal_4387 .cse11)))) (not (= (store (select .cse4 .cse10) .cse11 (select v_ArrVal_4388 .cse11)) v_ArrVal_4388)))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_prenex_59 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_17| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_17|)))) (let ((.cse13 (+ 40 v_prenex_59)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_61 (store (select .cse4 .cse12) .cse13 (select v_prenex_61 .cse13)))) (not (= (store (select .cse14 .cse12) .cse13 (select v_prenex_60 .cse13)) v_prenex_60)) (< v_prenex_59 .cse5) (< 0 (+ (let ((.cse15 (store .cse4 .cse12 v_prenex_61))) (select (select .cse15 (select (select (store .cse14 .cse12 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false