./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-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_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/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_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/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_f6e6d529-4e73-4f18-ac29-d525981dc938/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 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:48:33,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:48:34,049 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:48:34,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:48:34,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:48:34,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:48:34,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:48:34,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:48:34,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:48:34,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:48:34,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:48:34,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:48:34,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:48:34,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:48:34,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:48:34,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:48:34,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:48:34,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:48:34,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:48:34,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:48:34,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:48:34,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:48:34,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:48:34,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:48:34,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:48:34,099 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_f6e6d529-4e73-4f18-ac29-d525981dc938/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 -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2024-11-13 12:48:34,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:48:34,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:48:34,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:48:34,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:48:34,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:48:34,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i Unable to find full path for "g++" [2024-11-13 12:48:36,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:48:36,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:48:36,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2024-11-13 12:48:36,928 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/data/1fe0c1c57/83d3fe0aa8044232ba867f812f9a92e2/FLAGfd4d4a6d7 [2024-11-13 12:48:36,962 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/data/1fe0c1c57/83d3fe0aa8044232ba867f812f9a92e2 [2024-11-13 12:48:36,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:48:36,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:48:36,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:36,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:48:36,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:48:36,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:36" (1/1) ... [2024-11-13 12:48:36,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63674613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:36, skipping insertion in model container [2024-11-13 12:48:36,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:36" (1/1) ... [2024-11-13 12:48:37,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:48:37,766 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 12:48:37,789 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 12:48:37,797 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 12:48:37,806 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 12:48:37,820 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 12:48:37,861 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 12:48:37,861 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 12:48:37,864 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 12:48:37,864 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 12:48:37,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:37,888 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:48:38,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:38,140 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:48:38,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38 WrapperNode [2024-11-13 12:48:38,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:38,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:38,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:48:38,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:48:38,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,319 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3262 [2024-11-13 12:48:38,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:38,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:48:38,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:48:38,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:48:38,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,486 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-13 12:48:38,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:48:38,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:48:38,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:48:38,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:48:38,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (1/1) ... [2024-11-13 12:48:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:48:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:38,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:48:38,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:48:38,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 12:48:38,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 12:48:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:48:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:48:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 12:48:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 12:48:38,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 12:48:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:48:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:48:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 12:48:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 12:48:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 12:48:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 12:48:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 12:48:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 12:48:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 12:48:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 12:48:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:48:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 12:48:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 12:48:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 12:48:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:48:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 12:48:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 12:48:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 12:48:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:48:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:48:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:48:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 12:48:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:48:38,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:48:39,043 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:48:39,045 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:48:39,072 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 12:48:39,115 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 12:48:39,148 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 12:48:43,921 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-13 12:48:43,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:48:44,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:48:44,004 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-13 12:48:44,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:44 BoogieIcfgContainer [2024-11-13 12:48:44,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:48:44,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:48:44,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:48:44,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:48:44,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:48:36" (1/3) ... [2024-11-13 12:48:44,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f64845d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:48:44, skipping insertion in model container [2024-11-13 12:48:44,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:38" (2/3) ... [2024-11-13 12:48:44,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f64845d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:48:44, skipping insertion in model container [2024-11-13 12:48:44,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:44" (3/3) ... [2024-11-13 12:48:44,020 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-1.i [2024-11-13 12:48:44,036 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:48:44,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-1.i that has 6 procedures, 2076 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-13 12:48:44,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:48:44,158 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;@4385efb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:48:44,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-13 12:48:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 2066 states, 1136 states have (on average 2.007042253521127) internal successors, (2280), 2059 states have internal predecessors, (2280), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-13 12:48:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 12:48:44,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:44,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 12:48:44,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:44,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-13 12:48:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464290322] [2024-11-13 12:48:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:44,446 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 12:48:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464290322] [2024-11-13 12:48:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464290322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049511387] [2024-11-13 12:48:44,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:44,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:44,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:44,531 INFO L87 Difference]: Start difference. First operand has 2066 states, 1136 states have (on average 2.007042253521127) internal successors, (2280), 2059 states have internal predecessors, (2280), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 12:48:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:46,406 INFO L93 Difference]: Finished difference Result 2052 states and 3216 transitions. [2024-11-13 12:48:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-13 12:48:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:46,456 INFO L225 Difference]: With dead ends: 2052 [2024-11-13 12:48:46,456 INFO L226 Difference]: Without dead ends: 2050 [2024-11-13 12:48:46,458 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 12:48:46,460 INFO L432 NwaCegarLoop]: 2827 mSDtfsCounter, 2091 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:46,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 2879 Invalid, 959 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 12:48:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-11-13 12:48:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2024-11-13 12:48:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1138 states have (on average 1.9384885764499122) internal successors, (2206), 2043 states have internal predecessors, (2206), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-13 12:48:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3214 transitions. [2024-11-13 12:48:47,131 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3214 transitions. Word has length 3 [2024-11-13 12:48:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3214 transitions. [2024-11-13 12:48:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 12:48:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3214 transitions. [2024-11-13 12:48:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 12:48:47,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:47,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 12:48:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:48:47,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-13 12:48:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516920394] [2024-11-13 12:48:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:47,264 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 12:48:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516920394] [2024-11-13 12:48:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516920394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911415995] [2024-11-13 12:48:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:47,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:47,267 INFO L87 Difference]: Start difference. First operand 2050 states and 3214 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 12:48:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:49,387 INFO L93 Difference]: Finished difference Result 3814 states and 6130 transitions. [2024-11-13 12:48:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-13 12:48:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:49,409 INFO L225 Difference]: With dead ends: 3814 [2024-11-13 12:48:49,410 INFO L226 Difference]: Without dead ends: 3814 [2024-11-13 12:48:49,410 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 12:48:49,411 INFO L432 NwaCegarLoop]: 2929 mSDtfsCounter, 1908 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 5209 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:49,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 5209 Invalid, 1211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 12:48:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2024-11-13 12:48:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3550. [2024-11-13 12:48:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2139 states have (on average 1.9205236091631603) internal successors, (4108), 3541 states have internal predecessors, (4108), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:48:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 6120 transitions. [2024-11-13 12:48:49,923 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 6120 transitions. Word has length 3 [2024-11-13 12:48:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 3550 states and 6120 transitions. [2024-11-13 12:48:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 12:48:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 6120 transitions. [2024-11-13 12:48:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 12:48:49,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:49,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:48:49,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-13 12:48:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:49,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657106112] [2024-11-13 12:48:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:49,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:50,148 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 12:48:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657106112] [2024-11-13 12:48:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657106112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:50,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:50,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162069484] [2024-11-13 12:48:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:50,151 INFO L87 Difference]: Start difference. First operand 3550 states and 6120 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12:48:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:51,908 INFO L93 Difference]: Finished difference Result 6220 states and 11072 transitions. [2024-11-13 12:48:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-13 12:48:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:51,945 INFO L225 Difference]: With dead ends: 6220 [2024-11-13 12:48:51,945 INFO L226 Difference]: Without dead ends: 6220 [2024-11-13 12:48:51,945 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 12:48:51,948 INFO L432 NwaCegarLoop]: 5188 mSDtfsCounter, 1816 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 7678 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:51,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 7678 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 12:48:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2024-11-13 12:48:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 3618. [2024-11-13 12:48:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3618 states, 2217 states have (on average 1.9174560216508796) internal successors, (4251), 3609 states have internal predecessors, (4251), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:48:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 6263 transitions. [2024-11-13 12:48:52,807 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 6263 transitions. Word has length 8 [2024-11-13 12:48:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 3618 states and 6263 transitions. [2024-11-13 12:48:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12:48:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 6263 transitions. [2024-11-13 12:48:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 12:48:52,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:52,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:52,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:48:52,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-13 12:48:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761070242] [2024-11-13 12:48:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:52,903 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 12:48:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761070242] [2024-11-13 12:48:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761070242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318765567] [2024-11-13 12:48:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:52,905 INFO L87 Difference]: Start difference. First operand 3618 states and 6263 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12:48:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:54,422 INFO L93 Difference]: Finished difference Result 4881 states and 8573 transitions. [2024-11-13 12:48:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-13 12:48:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:54,445 INFO L225 Difference]: With dead ends: 4881 [2024-11-13 12:48:54,445 INFO L226 Difference]: Without dead ends: 4881 [2024-11-13 12:48:54,446 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 12:48:54,449 INFO L432 NwaCegarLoop]: 5026 mSDtfsCounter, 2076 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 7331 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:54,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 7331 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 12:48:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2024-11-13 12:48:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 3571. [2024-11-13 12:48:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 2217 states have (on average 1.8822733423545333) internal successors, (4173), 3562 states have internal predecessors, (4173), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:48:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 6185 transitions. [2024-11-13 12:48:54,992 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 6185 transitions. Word has length 8 [2024-11-13 12:48:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:54,992 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 6185 transitions. [2024-11-13 12:48:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12:48:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 6185 transitions. [2024-11-13 12:48:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 12:48:54,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:54,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:48:54,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1332904108, now seen corresponding path program 1 times [2024-11-13 12:48:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882703679] [2024-11-13 12:48:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:55,148 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 12:48:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882703679] [2024-11-13 12:48:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882703679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:55,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:55,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604332027] [2024-11-13 12:48:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:55,152 INFO L87 Difference]: Start difference. First operand 3571 states and 6185 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12:48:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:56,181 INFO L93 Difference]: Finished difference Result 6790 states and 11777 transitions. [2024-11-13 12:48:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:56,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-13 12:48:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:56,218 INFO L225 Difference]: With dead ends: 6790 [2024-11-13 12:48:56,218 INFO L226 Difference]: Without dead ends: 6790 [2024-11-13 12:48:56,219 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 12:48:56,219 INFO L432 NwaCegarLoop]: 3408 mSDtfsCounter, 2105 mSDsluCounter, 5998 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 9406 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:56,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 9406 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 12:48:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2024-11-13 12:48:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 3573. [2024-11-13 12:48:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2219 states have (on average 1.8814781433077963) internal successors, (4175), 3564 states have internal predecessors, (4175), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:48:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 6187 transitions. [2024-11-13 12:48:56,937 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 6187 transitions. Word has length 10 [2024-11-13 12:48:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 6187 transitions. [2024-11-13 12:48:56,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12:48:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 6187 transitions. [2024-11-13 12:48:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 12:48:56,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:56,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:48:56,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:48:56,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 183846302, now seen corresponding path program 1 times [2024-11-13 12:48:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582544485] [2024-11-13 12:48:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:57,047 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 12:48:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:57,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582544485] [2024-11-13 12:48:57,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582544485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:57,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:57,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100530562] [2024-11-13 12:48:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:57,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:57,049 INFO L87 Difference]: Start difference. First operand 3573 states and 6187 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 12:48:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:59,796 INFO L93 Difference]: Finished difference Result 3648 states and 6293 transitions. [2024-11-13 12:48:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:59,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-13 12:48:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:59,810 INFO L225 Difference]: With dead ends: 3648 [2024-11-13 12:48:59,810 INFO L226 Difference]: Without dead ends: 3648 [2024-11-13 12:48:59,810 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 12:48:59,811 INFO L432 NwaCegarLoop]: 2728 mSDtfsCounter, 2341 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2844 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:59,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2844 Valid, 4328 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 12:48:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2024-11-13 12:49:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3550. [2024-11-13 12:49:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2219 states have (on average 1.8607480847228481) internal successors, (4129), 3541 states have internal predecessors, (4129), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:49:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 6141 transitions. [2024-11-13 12:49:00,137 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 6141 transitions. Word has length 18 [2024-11-13 12:49:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:00,138 INFO L471 AbstractCegarLoop]: Abstraction has 3550 states and 6141 transitions. [2024-11-13 12:49:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 12:49:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 6141 transitions. [2024-11-13 12:49:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 12:49:00,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:00,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:49:00,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash 183846303, now seen corresponding path program 1 times [2024-11-13 12:49:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:00,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276811629] [2024-11-13 12:49:00,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:00,218 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 12:49:00,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:00,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276811629] [2024-11-13 12:49:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276811629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:00,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:49:00,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369647556] [2024-11-13 12:49:00,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:00,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:49:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:00,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:49:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:49:00,220 INFO L87 Difference]: Start difference. First operand 3550 states and 6141 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 12:49:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:00,271 INFO L93 Difference]: Finished difference Result 3412 states and 5935 transitions. [2024-11-13 12:49:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:49:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-13 12:49:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:00,284 INFO L225 Difference]: With dead ends: 3412 [2024-11-13 12:49:00,284 INFO L226 Difference]: Without dead ends: 3412 [2024-11-13 12:49:00,284 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 12:49:00,285 INFO L432 NwaCegarLoop]: 3009 mSDtfsCounter, 61 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5965 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 12:49:00,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5965 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:49:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-11-13 12:49:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3412. [2024-11-13 12:49:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 2093 states have (on average 1.8743430482560917) internal successors, (3923), 3403 states have internal predecessors, (3923), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:49:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5935 transitions. [2024-11-13 12:49:00,615 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5935 transitions. Word has length 18 [2024-11-13 12:49:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 5935 transitions. [2024-11-13 12:49:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 12:49:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5935 transitions. [2024-11-13 12:49:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 12:49:00,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:00,616 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] [2024-11-13 12:49:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:49:00,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 582794170, now seen corresponding path program 1 times [2024-11-13 12:49:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134396484] [2024-11-13 12:49:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:00,701 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 12:49:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134396484] [2024-11-13 12:49:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134396484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:00,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:00,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:49:00,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850417965] [2024-11-13 12:49:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:00,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:49:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:49:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:49:00,703 INFO L87 Difference]: Start difference. First operand 3412 states and 5935 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 12:49:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:00,800 INFO L93 Difference]: Finished difference Result 3383 states and 5885 transitions. [2024-11-13 12:49:00,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:49:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-13 12:49:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:00,812 INFO L225 Difference]: With dead ends: 3383 [2024-11-13 12:49:00,812 INFO L226 Difference]: Without dead ends: 3383 [2024-11-13 12:49:00,813 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 12:49:00,813 INFO L432 NwaCegarLoop]: 2974 mSDtfsCounter, 41 mSDsluCounter, 5920 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8894 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 12:49:00,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8894 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:49:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2024-11-13 12:49:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3377. [2024-11-13 12:49:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 2065 states have (on average 1.872639225181598) internal successors, (3867), 3368 states have internal predecessors, (3867), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:49:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5879 transitions. [2024-11-13 12:49:01,270 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5879 transitions. Word has length 20 [2024-11-13 12:49:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 3377 states and 5879 transitions. [2024-11-13 12:49:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 12:49:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5879 transitions. [2024-11-13 12:49:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 12:49:01,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:01,271 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] [2024-11-13 12:49:01,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:49:01,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1210970120, now seen corresponding path program 1 times [2024-11-13 12:49:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:01,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375714639] [2024-11-13 12:49:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:01,517 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 12:49:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375714639] [2024-11-13 12:49:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375714639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:49:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474557410] [2024-11-13 12:49:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:01,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:49:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:49:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:49:01,521 INFO L87 Difference]: Start difference. First operand 3377 states and 5879 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 12:49:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:05,387 INFO L93 Difference]: Finished difference Result 6073 states and 10832 transitions. [2024-11-13 12:49:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:49:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-13 12:49:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:05,414 INFO L225 Difference]: With dead ends: 6073 [2024-11-13 12:49:05,415 INFO L226 Difference]: Without dead ends: 6073 [2024-11-13 12:49:05,415 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 12:49:05,416 INFO L432 NwaCegarLoop]: 2812 mSDtfsCounter, 1817 mSDsluCounter, 3579 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:05,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2317 Valid, 6391 Invalid, 2392 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 12:49:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2024-11-13 12:49:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3373. [2024-11-13 12:49:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 2065 states have (on average 1.8687651331719128) internal successors, (3859), 3364 states have internal predecessors, (3859), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:49:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 5871 transitions. [2024-11-13 12:49:06,135 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 5871 transitions. Word has length 34 [2024-11-13 12:49:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:06,136 INFO L471 AbstractCegarLoop]: Abstraction has 3373 states and 5871 transitions. [2024-11-13 12:49:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 12:49:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 5871 transitions. [2024-11-13 12:49:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 12:49:06,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:06,138 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] [2024-11-13 12:49:06,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:49:06,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2067460550, now seen corresponding path program 1 times [2024-11-13 12:49:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782660029] [2024-11-13 12:49:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:06,285 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 12:49:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:06,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782660029] [2024-11-13 12:49:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782660029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:06,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:49:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361403500] [2024-11-13 12:49:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:06,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:49:06,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:49:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:49:06,288 INFO L87 Difference]: Start difference. First operand 3373 states and 5871 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 12:49:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:06,373 INFO L93 Difference]: Finished difference Result 3373 states and 5863 transitions. [2024-11-13 12:49:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:49:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-11-13 12:49:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:06,387 INFO L225 Difference]: With dead ends: 3373 [2024-11-13 12:49:06,387 INFO L226 Difference]: Without dead ends: 3373 [2024-11-13 12:49:06,387 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 12:49:06,388 INFO L432 NwaCegarLoop]: 2969 mSDtfsCounter, 21 mSDsluCounter, 5907 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8876 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 12:49:06,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8876 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:49:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2024-11-13 12:49:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2024-11-13 12:49:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 2065 states have (on average 1.8648910411622277) internal successors, (3851), 3364 states have internal predecessors, (3851), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-13 12:49:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 5863 transitions. [2024-11-13 12:49:06,829 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 5863 transitions. Word has length 68 [2024-11-13 12:49:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 3373 states and 5863 transitions. [2024-11-13 12:49:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 12:49:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 5863 transitions. [2024-11-13 12:49:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 12:49:06,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:06,831 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] [2024-11-13 12:49:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:49:06,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:06,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -484098810, now seen corresponding path program 1 times [2024-11-13 12:49:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896259656] [2024-11-13 12:49:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:07,107 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 12:49:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896259656] [2024-11-13 12:49:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896259656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:49:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217734272] [2024-11-13 12:49:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:07,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:49:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:07,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:49:07,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:49:07,111 INFO L87 Difference]: Start difference. First operand 3373 states and 5863 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 12:49:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:07,235 INFO L93 Difference]: Finished difference Result 5883 states and 10585 transitions. [2024-11-13 12:49:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:49:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-11-13 12:49:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:07,260 INFO L225 Difference]: With dead ends: 5883 [2024-11-13 12:49:07,260 INFO L226 Difference]: Without dead ends: 5883 [2024-11-13 12:49:07,261 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 12:49:07,261 INFO L432 NwaCegarLoop]: 3281 mSDtfsCounter, 1354 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:07,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 6220 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:49:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2024-11-13 12:49:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5826. [2024-11-13 12:49:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 3518 states have (on average 1.8675383740761797) internal successors, (6570), 5817 states have internal predecessors, (6570), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:49:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 10582 transitions. [2024-11-13 12:49:07,811 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 10582 transitions. Word has length 76 [2024-11-13 12:49:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:07,811 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 10582 transitions. [2024-11-13 12:49:07,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 12:49:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 10582 transitions. [2024-11-13 12:49:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 12:49:07,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:07,812 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] [2024-11-13 12:49:07,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:49:07,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 605410940, now seen corresponding path program 1 times [2024-11-13 12:49:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289243614] [2024-11-13 12:49:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:08,474 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 12:49:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289243614] [2024-11-13 12:49:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289243614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:49:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109166827] [2024-11-13 12:49:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:08,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:49:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:49:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:49:08,478 INFO L87 Difference]: Start difference. First operand 5826 states and 10582 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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 12:49:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:11,908 INFO L93 Difference]: Finished difference Result 5788 states and 10530 transitions. [2024-11-13 12:49:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:49:11,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2024-11-13 12:49:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:11,930 INFO L225 Difference]: With dead ends: 5788 [2024-11-13 12:49:11,930 INFO L226 Difference]: Without dead ends: 5788 [2024-11-13 12:49:11,931 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 12:49:11,931 INFO L432 NwaCegarLoop]: 2492 mSDtfsCounter, 3737 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4240 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4240 Valid, 3944 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 12:49:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2024-11-13 12:49:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5710. [2024-11-13 12:49:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 3440 states have (on average 1.8494186046511627) internal successors, (6362), 5701 states have internal predecessors, (6362), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:49:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 10374 transitions. [2024-11-13 12:49:12,610 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 10374 transitions. Word has length 79 [2024-11-13 12:49:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:12,611 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 10374 transitions. [2024-11-13 12:49:12,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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 12:49:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 10374 transitions. [2024-11-13 12:49:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 12:49:12,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:12,615 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] [2024-11-13 12:49:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:49:12,615 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:12,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1126930905, now seen corresponding path program 1 times [2024-11-13 12:49:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117157229] [2024-11-13 12:49:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:12,967 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 12:49:12,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117157229] [2024-11-13 12:49:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117157229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:49:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595122866] [2024-11-13 12:49:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:12,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:49:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:12,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:49:12,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:49:12,970 INFO L87 Difference]: Start difference. First operand 5710 states and 10374 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 12:49:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:13,828 INFO L93 Difference]: Finished difference Result 5709 states and 10372 transitions. [2024-11-13 12:49:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:49:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-13 12:49:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:13,886 INFO L225 Difference]: With dead ends: 5709 [2024-11-13 12:49:13,886 INFO L226 Difference]: Without dead ends: 5709 [2024-11-13 12:49:13,887 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 12:49:13,887 INFO L432 NwaCegarLoop]: 2942 mSDtfsCounter, 2 mSDsluCounter, 7858 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10800 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:13,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10800 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 12:49:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2024-11-13 12:49:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 5709. [2024-11-13 12:49:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 3440 states have (on average 1.8488372093023255) internal successors, (6360), 5700 states have internal predecessors, (6360), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:49:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 10372 transitions. [2024-11-13 12:49:14,560 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 10372 transitions. Word has length 84 [2024-11-13 12:49:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:14,561 INFO L471 AbstractCegarLoop]: Abstraction has 5709 states and 10372 transitions. [2024-11-13 12:49:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 12:49:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 10372 transitions. [2024-11-13 12:49:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 12:49:14,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:14,563 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] [2024-11-13 12:49:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:49:14,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1126930906, now seen corresponding path program 1 times [2024-11-13 12:49:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846197341] [2024-11-13 12:49:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:15,173 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 12:49:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846197341] [2024-11-13 12:49:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846197341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:49:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739304194] [2024-11-13 12:49:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:49:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:49:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:49:15,175 INFO L87 Difference]: Start difference. First operand 5709 states and 10372 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 12:49:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:16,314 INFO L93 Difference]: Finished difference Result 5708 states and 10370 transitions. [2024-11-13 12:49:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:49:16,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-13 12:49:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:16,336 INFO L225 Difference]: With dead ends: 5708 [2024-11-13 12:49:16,336 INFO L226 Difference]: Without dead ends: 5708 [2024-11-13 12:49:16,336 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 12:49:16,337 INFO L432 NwaCegarLoop]: 2942 mSDtfsCounter, 1 mSDsluCounter, 7842 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10784 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:16,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10784 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 12:49:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2024-11-13 12:49:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5708. [2024-11-13 12:49:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5708 states, 3438 states have (on average 1.8493310063990693) internal successors, (6358), 5699 states have internal predecessors, (6358), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:49:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 10370 transitions. [2024-11-13 12:49:17,163 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 10370 transitions. Word has length 84 [2024-11-13 12:49:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 5708 states and 10370 transitions. [2024-11-13 12:49:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 12:49:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 10370 transitions. [2024-11-13 12:49:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 12:49:17,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:17,165 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 12:49:17,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:49:17,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:17,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2061752800, now seen corresponding path program 1 times [2024-11-13 12:49:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138490694] [2024-11-13 12:49:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:49:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:17,524 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 12:49:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138490694] [2024-11-13 12:49:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138490694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:49:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218164581] [2024-11-13 12:49:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:49:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:49:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:49:17,528 INFO L87 Difference]: Start difference. First operand 5708 states and 10370 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:49:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:23,331 INFO L93 Difference]: Finished difference Result 5726 states and 10396 transitions. [2024-11-13 12:49:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:49:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-13 12:49:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:23,351 INFO L225 Difference]: With dead ends: 5726 [2024-11-13 12:49:23,351 INFO L226 Difference]: Without dead ends: 5726 [2024-11-13 12:49:23,351 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 12:49:23,352 INFO L432 NwaCegarLoop]: 2927 mSDtfsCounter, 17 mSDsluCounter, 9915 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12842 SdHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:23,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12842 Invalid, 4817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-13 12:49:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2024-11-13 12:49:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5717. [2024-11-13 12:49:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 3446 states have (on average 1.8482298316889147) internal successors, (6369), 5706 states have internal predecessors, (6369), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-13 12:49:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 10386 transitions. [2024-11-13 12:49:24,120 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 10386 transitions. Word has length 92 [2024-11-13 12:49:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:24,120 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 10386 transitions. [2024-11-13 12:49:24,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:49:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 10386 transitions. [2024-11-13 12:49:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 12:49:24,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:24,122 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 12:49:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:49:24,122 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2061752801, now seen corresponding path program 1 times [2024-11-13 12:49:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416499217] [2024-11-13 12:49:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:49:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:24,831 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 12:49:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416499217] [2024-11-13 12:49:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416499217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:49:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545616345] [2024-11-13 12:49:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:24,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:49:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:49:24,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:49:24,834 INFO L87 Difference]: Start difference. First operand 5717 states and 10386 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:49:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:29,807 INFO L93 Difference]: Finished difference Result 5717 states and 10384 transitions. [2024-11-13 12:49:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:49:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-13 12:49:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:29,829 INFO L225 Difference]: With dead ends: 5717 [2024-11-13 12:49:29,829 INFO L226 Difference]: Without dead ends: 5717 [2024-11-13 12:49:29,830 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 12:49:29,831 INFO L432 NwaCegarLoop]: 2931 mSDtfsCounter, 18 mSDsluCounter, 8135 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11066 SdHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:29,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11066 Invalid, 4147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-13 12:49:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2024-11-13 12:49:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5717. [2024-11-13 12:49:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 3446 states have (on average 1.8476494486361) internal successors, (6367), 5706 states have internal predecessors, (6367), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2024-11-13 12:49:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 10384 transitions. [2024-11-13 12:49:30,432 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 10384 transitions. Word has length 92 [2024-11-13 12:49:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 10384 transitions. [2024-11-13 12:49:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:49:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 10384 transitions. [2024-11-13 12:49:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:49:30,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:30,434 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] [2024-11-13 12:49:30,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:49:30,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1740504854, now seen corresponding path program 1 times [2024-11-13 12:49:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:30,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172426038] [2024-11-13 12:49:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:49:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:31,140 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 12:49:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172426038] [2024-11-13 12:49:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172426038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684014332] [2024-11-13 12:49:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:31,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:31,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:49:31,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:49:31,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:49:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:31,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 12:49:31,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:31,599 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:49:31,600 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 12:49:31,651 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 12:49:31,780 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 12:49:32,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:49:32,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 42 treesize of output 41 [2024-11-13 12:49:32,287 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 12:49:32,359 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 12:49:32,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:32,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_645) |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 12:49:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684014332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:32,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:49:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-13 12:49:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300110492] [2024-11-13 12:49:32,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:49:32,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:49:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:49:32,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-13 12:49:32,440 INFO L87 Difference]: Start difference. First operand 5717 states and 10384 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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 12:49:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:47,088 INFO L93 Difference]: Finished difference Result 5724 states and 10390 transitions. [2024-11-13 12:49:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:49:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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 93 [2024-11-13 12:49:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:47,106 INFO L225 Difference]: With dead ends: 5724 [2024-11-13 12:49:47,106 INFO L226 Difference]: Without dead ends: 5724 [2024-11-13 12:49:47,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-13 12:49:47,107 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1891 mSDsluCounter, 21246 mSDsCounter, 0 mSdLazyCounter, 14384 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 23862 SdHoareTripleChecker+Invalid, 14900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 14384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:47,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 23862 Invalid, 14900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 14384 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2024-11-13 12:49:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2024-11-13 12:49:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5721. [2024-11-13 12:49:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5721 states, 3450 states have (on average 1.846376811594203) internal successors, (6370), 5709 states have internal predecessors, (6370), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:49:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5721 states to 5721 states and 10384 transitions. [2024-11-13 12:49:47,672 INFO L78 Accepts]: Start accepts. Automaton has 5721 states and 10384 transitions. Word has length 93 [2024-11-13 12:49:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:47,672 INFO L471 AbstractCegarLoop]: Abstraction has 5721 states and 10384 transitions. [2024-11-13 12:49:47,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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 12:49:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5721 states and 10384 transitions. [2024-11-13 12:49:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:49:47,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:47,674 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] [2024-11-13 12:49:47,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:49:47,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:49:47,875 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1740504855, now seen corresponding path program 1 times [2024-11-13 12:49:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928238621] [2024-11-13 12:49:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:49:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:48,907 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 12:49:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928238621] [2024-11-13 12:49:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928238621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346997416] [2024-11-13 12:49:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:48,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:48,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:49:48,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:49:48,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:49:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:49,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 12:49:49,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:49,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:49:49,307 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 12:49:49,313 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 12:49:49,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 12:49:49,337 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 12:49:49,425 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 12:49:49,432 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 12:49:49,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:49:49,570 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 12:49:49,585 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 12:49:49,620 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 12:49:49,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 12:49:49,631 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 12:49:49,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:49,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-13 12:49:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346997416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:49,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:49:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-13 12:49:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27654271] [2024-11-13 12:49:49,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:49:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 12:49:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:49:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-13 12:49:49,761 INFO L87 Difference]: Start difference. First operand 5721 states and 10384 transitions. Second operand has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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 12:49:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:57,831 INFO L93 Difference]: Finished difference Result 5723 states and 10388 transitions. [2024-11-13 12:49:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:49:57,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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 93 [2024-11-13 12:49:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:57,851 INFO L225 Difference]: With dead ends: 5723 [2024-11-13 12:49:57,851 INFO L226 Difference]: Without dead ends: 5723 [2024-11-13 12:49:57,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-13 12:49:57,852 INFO L432 NwaCegarLoop]: 2619 mSDtfsCounter, 1896 mSDsluCounter, 12815 mSDsCounter, 0 mSdLazyCounter, 8592 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 15434 SdHoareTripleChecker+Invalid, 9612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 8592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:57,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 15434 Invalid, 9612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1020 Valid, 8592 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-13 12:49:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2024-11-13 12:49:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5711. [2024-11-13 12:49:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 3442 states have (on average 1.847472399767577) internal successors, (6359), 5701 states have internal predecessors, (6359), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:49:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 10371 transitions. [2024-11-13 12:49:58,322 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 10371 transitions. Word has length 93 [2024-11-13 12:49:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 10371 transitions. [2024-11-13 12:49:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 15 states have internal predecessors, (112), 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 12:49:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 10371 transitions. [2024-11-13 12:49:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 12:49:58,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:58,323 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 12:49:58,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:49:58,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 12:49:58,528 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:49:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -648999741, now seen corresponding path program 1 times [2024-11-13 12:49:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579589149] [2024-11-13 12:49:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:49:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:49:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579589149] [2024-11-13 12:49:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579589149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:49:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477924350] [2024-11-13 12:49:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:49:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:49:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:49:59,196 INFO L87 Difference]: Start difference. First operand 5711 states and 10371 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:50:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:08,009 INFO L93 Difference]: Finished difference Result 5730 states and 10396 transitions. [2024-11-13 12:50:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:50:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-13 12:50:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:08,029 INFO L225 Difference]: With dead ends: 5730 [2024-11-13 12:50:08,029 INFO L226 Difference]: Without dead ends: 5730 [2024-11-13 12:50:08,029 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 12:50:08,029 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1909 mSDsluCounter, 14837 mSDsCounter, 0 mSdLazyCounter, 9030 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 17453 SdHoareTripleChecker+Invalid, 9543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 9030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:08,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 17453 Invalid, 9543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 9030 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-13 12:50:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2024-11-13 12:50:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5726. [2024-11-13 12:50:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 3456 states have (on average 1.8449074074074074) internal successors, (6376), 5714 states have internal predecessors, (6376), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:50:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 10390 transitions. [2024-11-13 12:50:08,769 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 10390 transitions. Word has length 95 [2024-11-13 12:50:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 5726 states and 10390 transitions. [2024-11-13 12:50:08,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:50:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 10390 transitions. [2024-11-13 12:50:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 12:50:08,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:08,771 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 12:50:08,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:50:08,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:50:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -648999740, now seen corresponding path program 1 times [2024-11-13 12:50:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689451271] [2024-11-13 12:50:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:50:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:09,680 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 12:50:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689451271] [2024-11-13 12:50:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689451271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 12:50:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681308228] [2024-11-13 12:50:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:50:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:50:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:50:09,684 INFO L87 Difference]: Start difference. First operand 5726 states and 10390 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:50:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:16,124 INFO L93 Difference]: Finished difference Result 5729 states and 10394 transitions. [2024-11-13 12:50:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:50:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-13 12:50:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:16,145 INFO L225 Difference]: With dead ends: 5729 [2024-11-13 12:50:16,146 INFO L226 Difference]: Without dead ends: 5729 [2024-11-13 12:50:16,146 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 12:50:16,146 INFO L432 NwaCegarLoop]: 2620 mSDtfsCounter, 1912 mSDsluCounter, 9625 mSDsCounter, 0 mSdLazyCounter, 5410 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 12245 SdHoareTripleChecker+Invalid, 6426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 5410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:16,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 12245 Invalid, 6426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1016 Valid, 5410 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-13 12:50:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2024-11-13 12:50:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5726. [2024-11-13 12:50:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 3456 states have (on average 1.8443287037037037) internal successors, (6374), 5714 states have internal predecessors, (6374), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:50:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 10388 transitions. [2024-11-13 12:50:16,874 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 10388 transitions. Word has length 95 [2024-11-13 12:50:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:16,875 INFO L471 AbstractCegarLoop]: Abstraction has 5726 states and 10388 transitions. [2024-11-13 12:50:16,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:50:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 10388 transitions. [2024-11-13 12:50:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 12:50:16,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:16,876 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] [2024-11-13 12:50:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:50:16,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:50:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1759423539, now seen corresponding path program 1 times [2024-11-13 12:50:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707058545] [2024-11-13 12:50:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:50:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:17,575 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 12:50:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707058545] [2024-11-13 12:50:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707058545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84581682] [2024-11-13 12:50:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:17,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:17,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:17,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:17,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:50:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:17,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 12:50:17,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:17,993 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:50:17,993 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 12:50:18,035 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 12:50:18,143 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 12:50:18,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:50:18,332 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 12:50:18,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:50:18,446 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 12:50:18,469 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 12:50:18,503 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 12:50:18,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:18,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 12:50:18,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1084 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1081)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:50:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84581682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:18,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:50:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-13 12:50:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424198357] [2024-11-13 12:50:18,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 12:50:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:50:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=428, Unknown=10, NotChecked=86, Total=600 [2024-11-13 12:50:18,597 INFO L87 Difference]: Start difference. First operand 5726 states and 10388 transitions. Second operand has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 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 12:50:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:32,681 INFO L93 Difference]: Finished difference Result 5728 states and 10392 transitions. [2024-11-13 12:50:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:50:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-13 12:50:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:32,697 INFO L225 Difference]: With dead ends: 5728 [2024-11-13 12:50:32,697 INFO L226 Difference]: Without dead ends: 5728 [2024-11-13 12:50:32,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=597, Unknown=10, NotChecked=102, Total=812 [2024-11-13 12:50:32,698 INFO L432 NwaCegarLoop]: 2615 mSDtfsCounter, 1900 mSDsluCounter, 20731 mSDsCounter, 0 mSdLazyCounter, 14372 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 23346 SdHoareTripleChecker+Invalid, 14889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 14372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:32,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 23346 Invalid, 14889 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 14372 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-13 12:50:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5728 states. [2024-11-13 12:50:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5728 to 5725. [2024-11-13 12:50:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 3456 states have (on average 1.84375) internal successors, (6372), 5713 states have internal predecessors, (6372), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:50:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 10386 transitions. [2024-11-13 12:50:33,463 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 10386 transitions. Word has length 96 [2024-11-13 12:50:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:33,464 INFO L471 AbstractCegarLoop]: Abstraction has 5725 states and 10386 transitions. [2024-11-13 12:50:33,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 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 12:50:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 10386 transitions. [2024-11-13 12:50:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 12:50:33,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:33,465 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] [2024-11-13 12:50:33,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:50:33,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:33,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:50:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1759423538, now seen corresponding path program 1 times [2024-11-13 12:50:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87688445] [2024-11-13 12:50:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:50:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:34,622 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 12:50:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:34,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87688445] [2024-11-13 12:50:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87688445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:34,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316147311] [2024-11-13 12:50:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:34,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:34,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:34,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:50:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:34,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 12:50:34,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:35,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:50:35,055 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 12:50:35,062 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 12:50:35,076 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 12:50:35,089 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 12:50:35,156 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 12:50:35,166 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 12:50:35,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:50:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 12:50:35,321 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 12:50:35,397 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:50:35,397 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 12:50:35,409 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 12:50:35,430 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 12:50:35,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 12:50:35,442 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 12:50:35,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:35,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1248))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1247) .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1247) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-13 12:50:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316147311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:35,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:50:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2024-11-13 12:50:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855577203] [2024-11-13 12:50:35,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:35,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:50:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:50:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=335, Unknown=21, NotChecked=38, Total=462 [2024-11-13 12:50:35,737 INFO L87 Difference]: Start difference. First operand 5725 states and 10386 transitions. Second operand has 17 states, 15 states have (on average 7.733333333333333) internal successors, (116), 16 states have internal predecessors, (116), 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 12:50:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:48,093 INFO L93 Difference]: Finished difference Result 5727 states and 10390 transitions. [2024-11-13 12:50:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:50:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.733333333333333) internal successors, (116), 16 states have internal predecessors, (116), 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 96 [2024-11-13 12:50:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:48,106 INFO L225 Difference]: With dead ends: 5727 [2024-11-13 12:50:48,106 INFO L226 Difference]: Without dead ends: 5727 [2024-11-13 12:50:48,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=566, Unknown=24, NotChecked=50, Total=756 [2024-11-13 12:50:48,108 INFO L432 NwaCegarLoop]: 2618 mSDtfsCounter, 1884 mSDsluCounter, 15890 mSDsCounter, 0 mSdLazyCounter, 9859 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 18508 SdHoareTripleChecker+Invalid, 10374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 9859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:48,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 18508 Invalid, 10374 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 9859 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-13 12:50:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2024-11-13 12:50:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 5709. [2024-11-13 12:50:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 3442 states have (on average 1.8463102847181871) internal successors, (6355), 5699 states have internal predecessors, (6355), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:50:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 10367 transitions. [2024-11-13 12:50:48,844 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 10367 transitions. Word has length 96 [2024-11-13 12:50:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:48,844 INFO L471 AbstractCegarLoop]: Abstraction has 5709 states and 10367 transitions. [2024-11-13 12:50:48,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.733333333333333) internal successors, (116), 16 states have internal predecessors, (116), 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 12:50:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 10367 transitions. [2024-11-13 12:50:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 12:50:48,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:48,846 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 12:50:48,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:50:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 12:50:49,047 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:50:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1592124967, now seen corresponding path program 1 times [2024-11-13 12:50:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83735624] [2024-11-13 12:50:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:50:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:50,009 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 12:50:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:50,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83735624] [2024-11-13 12:50:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83735624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 12:50:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090417288] [2024-11-13 12:50:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:50,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:50:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:50:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:50:50,013 INFO L87 Difference]: Start difference. First operand 5709 states and 10367 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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 12:50:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:59,888 INFO L93 Difference]: Finished difference Result 5734 states and 10398 transitions. [2024-11-13 12:50:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:50:59,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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 12:50:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:59,898 INFO L225 Difference]: With dead ends: 5734 [2024-11-13 12:50:59,898 INFO L226 Difference]: Without dead ends: 5734 [2024-11-13 12:50:59,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:50:59,899 INFO L432 NwaCegarLoop]: 2615 mSDtfsCounter, 1896 mSDsluCounter, 17500 mSDsCounter, 0 mSdLazyCounter, 12214 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 20115 SdHoareTripleChecker+Invalid, 12728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 12214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:59,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 20115 Invalid, 12728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 12214 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-13 12:50:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2024-11-13 12:51:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 5730. [2024-11-13 12:51:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5730 states, 3462 states have (on average 1.8422876949740035) internal successors, (6378), 5718 states have internal predecessors, (6378), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:51:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 10392 transitions. [2024-11-13 12:51:00,430 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 10392 transitions. Word has length 98 [2024-11-13 12:51:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:00,430 INFO L471 AbstractCegarLoop]: Abstraction has 5730 states and 10392 transitions. [2024-11-13 12:51:00,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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 12:51:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 10392 transitions. [2024-11-13 12:51:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 12:51:00,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:00,431 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 12:51:00,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:51:00,432 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:51:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1592124968, now seen corresponding path program 1 times [2024-11-13 12:51:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:51:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736300827] [2024-11-13 12:51:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:51:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:51:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:01,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 12:51:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:51:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736300827] [2024-11-13 12:51:01,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736300827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:51:01,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:51:01,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 12:51:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260058015] [2024-11-13 12:51:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:01,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:51:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:51:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:51:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:51:01,315 INFO L87 Difference]: Start difference. First operand 5730 states and 10392 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 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 12:51:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:10,475 INFO L93 Difference]: Finished difference Result 5733 states and 10396 transitions. [2024-11-13 12:51:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:51:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 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 12:51:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:10,484 INFO L225 Difference]: With dead ends: 5733 [2024-11-13 12:51:10,485 INFO L226 Difference]: Without dead ends: 5733 [2024-11-13 12:51:10,485 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 12:51:10,485 INFO L432 NwaCegarLoop]: 2619 mSDtfsCounter, 1906 mSDsluCounter, 14784 mSDsCounter, 0 mSdLazyCounter, 8013 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 17403 SdHoareTripleChecker+Invalid, 8525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 8013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:10,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 17403 Invalid, 8525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 8013 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-13 12:51:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-11-13 12:51:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5730. [2024-11-13 12:51:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5730 states, 3462 states have (on average 1.8417099942229924) internal successors, (6376), 5718 states have internal predecessors, (6376), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:51:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 10390 transitions. [2024-11-13 12:51:10,928 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 10390 transitions. Word has length 98 [2024-11-13 12:51:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 5730 states and 10390 transitions. [2024-11-13 12:51:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 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 12:51:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 10390 transitions. [2024-11-13 12:51:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 12:51:10,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:10,930 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 12:51:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 12:51:10,930 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:51:10,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash 794872541, now seen corresponding path program 1 times [2024-11-13 12:51:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:51:10,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197127216] [2024-11-13 12:51:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:51:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:51:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:11,677 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 12:51:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:51:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197127216] [2024-11-13 12:51:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197127216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166061445] [2024-11-13 12:51:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:11,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:51:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:51:11,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:51:11,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:51:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:11,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:51:11,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:12,077 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:51:12,077 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 12:51:12,109 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 12:51:12,208 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 12:51:12,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:12,364 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 12:51:12,455 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:12,455 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 12:51:12,518 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:12,518 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 12:51:12,537 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 12:51:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:51:12,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:12,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1559) |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 12:51:12,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 12:51:12,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1562 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1562))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1558)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1559)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:51:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166061445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:12,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:51:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-11-13 12:51:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833705782] [2024-11-13 12:51:12,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:51:12,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 12:51:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:51:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 12:51:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=533, Unknown=30, NotChecked=150, Total=812 [2024-11-13 12:51:12,721 INFO L87 Difference]: Start difference. First operand 5730 states and 10390 transitions. Second operand has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 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 12:51:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:31,504 INFO L93 Difference]: Finished difference Result 5732 states and 10394 transitions. [2024-11-13 12:51:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:51:31,505 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 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 12:51:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:31,513 INFO L225 Difference]: With dead ends: 5732 [2024-11-13 12:51:31,513 INFO L226 Difference]: Without dead ends: 5732 [2024-11-13 12:51:31,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=722, Unknown=33, NotChecked=174, Total=1056 [2024-11-13 12:51:31,514 INFO L432 NwaCegarLoop]: 2614 mSDtfsCounter, 1891 mSDsluCounter, 24416 mSDsCounter, 0 mSdLazyCounter, 17022 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 27030 SdHoareTripleChecker+Invalid, 17538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 17022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:31,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 27030 Invalid, 17538 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 17022 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2024-11-13 12:51:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2024-11-13 12:51:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 5729. [2024-11-13 12:51:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 3462 states have (on average 1.8411322934719816) internal successors, (6374), 5717 states have internal predecessors, (6374), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:51:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 10388 transitions. [2024-11-13 12:51:32,069 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 10388 transitions. Word has length 99 [2024-11-13 12:51:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:32,069 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 10388 transitions. [2024-11-13 12:51:32,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 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 12:51:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 10388 transitions. [2024-11-13 12:51:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 12:51:32,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:32,071 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 12:51:32,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:51:32,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:51:32,271 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:51:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 794872542, now seen corresponding path program 1 times [2024-11-13 12:51:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:51:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260136763] [2024-11-13 12:51:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:51:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:51:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:33,290 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 12:51:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:51:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260136763] [2024-11-13 12:51:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260136763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442374042] [2024-11-13 12:51:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:51:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:51:33,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:51:33,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:51:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:33,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 12:51:33,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:33,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:51:33,662 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 12:51:33,670 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 12:51:33,699 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 12:51:33,702 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 12:51:33,783 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 12:51:33,790 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 12:51:33,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:33,883 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 12:51:33,892 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 12:51:33,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:33,968 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 12:51:33,974 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 12:51:34,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:51:34,039 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 12:51:34,049 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 12:51:34,071 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 12:51:34,076 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 12:51:34,100 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 12:51:34,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:34,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1733 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 12:51:34,180 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1733 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-13 12:51:34,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1732))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1731) .cse0 v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1731) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-13 12:51:34,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1739))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1740) .cse0 v_ArrVal_1731) (select (select (store .cse1 .cse0 v_ArrVal_1732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1733))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1739 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1739))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1732))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1740) .cse3 v_ArrVal_1731) .cse4 v_ArrVal_1733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 12:51:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442374042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:34,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:51:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2024-11-13 12:51:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203615309] [2024-11-13 12:51:34,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:51:34,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 12:51:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:51:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 12:51:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=559, Unknown=9, NotChecked=204, Total=870 [2024-11-13 12:51:34,382 INFO L87 Difference]: Start difference. First operand 5729 states and 10388 transitions. Second operand has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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 12:51:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:56,465 INFO L93 Difference]: Finished difference Result 5731 states and 10392 transitions. [2024-11-13 12:51:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:51:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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 12:51:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:56,474 INFO L225 Difference]: With dead ends: 5731 [2024-11-13 12:51:56,474 INFO L226 Difference]: Without dead ends: 5731 [2024-11-13 12:51:56,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=899, Unknown=10, NotChecked=260, Total=1332 [2024-11-13 12:51:56,475 INFO L432 NwaCegarLoop]: 2617 mSDtfsCounter, 1901 mSDsluCounter, 26145 mSDsCounter, 0 mSdLazyCounter, 14810 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 28762 SdHoareTripleChecker+Invalid, 15329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 14810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:56,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2405 Valid, 28762 Invalid, 15329 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [519 Valid, 14810 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2024-11-13 12:51:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5731 states. [2024-11-13 12:51:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5731 to 5707. [2024-11-13 12:51:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5707 states, 3442 states have (on average 1.8451481696687972) internal successors, (6351), 5697 states have internal predecessors, (6351), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:51:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5707 states to 5707 states and 10363 transitions. [2024-11-13 12:51:56,871 INFO L78 Accepts]: Start accepts. Automaton has 5707 states and 10363 transitions. Word has length 99 [2024-11-13 12:51:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:56,871 INFO L471 AbstractCegarLoop]: Abstraction has 5707 states and 10363 transitions. [2024-11-13 12:51:56,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 22 states have internal predecessors, (130), 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 12:51:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 10363 transitions. [2024-11-13 12:51:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 12:51:56,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:56,872 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 12:51:56,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:51:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:51:57,073 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:51:57,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1671691626, now seen corresponding path program 1 times [2024-11-13 12:51:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:51:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841346911] [2024-11-13 12:51:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:51:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:51:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:57,746 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 12:51:57,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:51:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841346911] [2024-11-13 12:51:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841346911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:51:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:51:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 12:51:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319643522] [2024-11-13 12:51:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:57,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 12:51:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:51:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:51:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:51:57,748 INFO L87 Difference]: Start difference. First operand 5707 states and 10363 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) 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 12:52:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:06,337 INFO L93 Difference]: Finished difference Result 5738 states and 10400 transitions. [2024-11-13 12:52:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:52:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) 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 12:52:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:06,346 INFO L225 Difference]: With dead ends: 5738 [2024-11-13 12:52:06,346 INFO L226 Difference]: Without dead ends: 5738 [2024-11-13 12:52:06,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:52:06,347 INFO L432 NwaCegarLoop]: 2614 mSDtfsCounter, 1915 mSDsluCounter, 14325 mSDsCounter, 0 mSdLazyCounter, 9548 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2419 SdHoareTripleChecker+Valid, 16939 SdHoareTripleChecker+Invalid, 10062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 9548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:06,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2419 Valid, 16939 Invalid, 10062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 9548 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-13 12:52:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2024-11-13 12:52:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5734. [2024-11-13 12:52:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 3468 states have (on average 1.839677047289504) internal successors, (6380), 5722 states have internal predecessors, (6380), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:52:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 10394 transitions. [2024-11-13 12:52:06,839 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 10394 transitions. Word has length 101 [2024-11-13 12:52:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:06,839 INFO L471 AbstractCegarLoop]: Abstraction has 5734 states and 10394 transitions. [2024-11-13 12:52:06,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) 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 12:52:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 10394 transitions. [2024-11-13 12:52:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 12:52:06,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:06,840 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 12:52:06,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:52:06,840 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:52:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1671691627, now seen corresponding path program 1 times [2024-11-13 12:52:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:52:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063902940] [2024-11-13 12:52:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:06,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:52:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:52:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:07,860 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 12:52:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:52:07,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063902940] [2024-11-13 12:52:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063902940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:52:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:52:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:52:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339740312] [2024-11-13 12:52:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:07,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:52:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:52:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:52:07,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:52:07,862 INFO L87 Difference]: Start difference. First operand 5734 states and 10394 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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 12:52:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:16,022 INFO L93 Difference]: Finished difference Result 5737 states and 10398 transitions. [2024-11-13 12:52:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:52:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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 12:52:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:16,031 INFO L225 Difference]: With dead ends: 5737 [2024-11-13 12:52:16,031 INFO L226 Difference]: Without dead ends: 5737 [2024-11-13 12:52:16,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:52:16,032 INFO L432 NwaCegarLoop]: 2618 mSDtfsCounter, 1894 mSDsluCounter, 13181 mSDsCounter, 0 mSdLazyCounter, 7717 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 15799 SdHoareTripleChecker+Invalid, 8733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 7717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:16,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 15799 Invalid, 8733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1016 Valid, 7717 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-13 12:52:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2024-11-13 12:52:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 5734. [2024-11-13 12:52:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 3468 states have (on average 1.8391003460207613) internal successors, (6378), 5722 states have internal predecessors, (6378), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:52:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 10392 transitions. [2024-11-13 12:52:16,441 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 10392 transitions. Word has length 101 [2024-11-13 12:52:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 5734 states and 10392 transitions. [2024-11-13 12:52:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 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 12:52:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 10392 transitions. [2024-11-13 12:52:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:52:16,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:16,442 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 12:52:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 12:52:16,443 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:52:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1893815540, now seen corresponding path program 1 times [2024-11-13 12:52:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:52:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778530719] [2024-11-13 12:52:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:52:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:52:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:17,115 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 12:52:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:52:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778530719] [2024-11-13 12:52:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778530719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644033130] [2024-11-13 12:52:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:17,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:52:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:52:17,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:52:17,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:52:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:17,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 12:52:17,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:17,514 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:52:17,514 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 12:52:17,547 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 12:52:17,643 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 12:52:17,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:17,782 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 12:52:17,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:17,873 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 12:52:17,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:17,942 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 12:52:18,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:18,003 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 12:52:18,025 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 12:52:18,064 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 12:52:18,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:18,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2076) |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 12:52:18,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (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$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2075))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:52:22,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2074 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2074))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2075)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:52:22,329 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2074 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2074))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2075)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:52:22,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2074 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2079))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2074)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2075)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 12:52:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644033130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:22,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:52:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-13 12:52:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111429150] [2024-11-13 12:52:22,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:52:22,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 12:52:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:52:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 12:52:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=630, Unknown=22, NotChecked=280, Total=1056 [2024-11-13 12:52:22,379 INFO L87 Difference]: Start difference. First operand 5734 states and 10392 transitions. Second operand has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 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 12:52:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:45,186 INFO L93 Difference]: Finished difference Result 5736 states and 10396 transitions. [2024-11-13 12:52:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:52:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 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 102 [2024-11-13 12:52:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:45,194 INFO L225 Difference]: With dead ends: 5736 [2024-11-13 12:52:45,194 INFO L226 Difference]: Without dead ends: 5736 [2024-11-13 12:52:45,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=153, Invalid=836, Unknown=23, NotChecked=320, Total=1332 [2024-11-13 12:52:45,195 INFO L432 NwaCegarLoop]: 2613 mSDtfsCounter, 1870 mSDsluCounter, 24388 mSDsCounter, 0 mSdLazyCounter, 17034 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 27001 SdHoareTripleChecker+Invalid, 17550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 17034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:45,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 27001 Invalid, 17550 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 17034 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2024-11-13 12:52:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2024-11-13 12:52:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 5733. [2024-11-13 12:52:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5733 states, 3468 states have (on average 1.8385236447520183) internal successors, (6376), 5721 states have internal predecessors, (6376), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:52:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 10390 transitions. [2024-11-13 12:52:45,624 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 10390 transitions. Word has length 102 [2024-11-13 12:52:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 5733 states and 10390 transitions. [2024-11-13 12:52:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 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 12:52:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 10390 transitions. [2024-11-13 12:52:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:52:45,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:45,625 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 12:52:45,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 12:52:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:52:45,826 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:52:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1893815541, now seen corresponding path program 1 times [2024-11-13 12:52:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:52:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117702918] [2024-11-13 12:52:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:52:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:46,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:52:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:47,049 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 12:52:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:52:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117702918] [2024-11-13 12:52:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117702918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772415439] [2024-11-13 12:52:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:52:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:52:47,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:52:47,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:52:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:47,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 12:52:47,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:47,503 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 12:52:47,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:52:47,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 12:52:47,534 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 12:52:47,542 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 12:52:47,641 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 12:52:47,645 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 12:52:47,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:47,811 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 12:52:47,817 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 12:52:47,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:47,939 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 12:52:47,951 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 12:52:48,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:48,047 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 12:52:48,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 12:52:48,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:52:48,162 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 12:52:48,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 12:52:48,195 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 12:52:48,200 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 12:52:48,207 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 12:52:48,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:48,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 12:52:48,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2262) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2263))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2262) .cse1 v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 12:52:48,423 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2263))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2262) .cse1 v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2262) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-13 12:52:48,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2260))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2263))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2261) .cse0 v_ArrVal_2262) .cse1 v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2260))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2261) .cse5 v_ArrVal_2262) (select (select (store .cse6 .cse5 v_ArrVal_2263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2264))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 12:52:48,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2271 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2270))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2260))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2263))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2271) .cse0 v_ArrVal_2261) .cse1 v_ArrVal_2262) .cse2 v_ArrVal_2264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2271 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2270))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2260))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2271) .cse7 v_ArrVal_2261) .cse8 v_ArrVal_2262) (select (select (store .cse9 .cse8 v_ArrVal_2263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2264))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-13 12:52:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772415439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:48,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:52:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2024-11-13 12:52:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710828919] [2024-11-13 12:52:48,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:52:48,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 12:52:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:52:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:52:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=537, Unknown=18, NotChecked=260, Total=930 [2024-11-13 12:52:48,716 INFO L87 Difference]: Start difference. First operand 5733 states and 10390 transitions. Second operand has 22 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:53:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:18,019 INFO L93 Difference]: Finished difference Result 5735 states and 10394 transitions. [2024-11-13 12:53:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:53:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-13 12:53:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:18,028 INFO L225 Difference]: With dead ends: 5735 [2024-11-13 12:53:18,028 INFO L226 Difference]: Without dead ends: 5735 [2024-11-13 12:53:18,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=935, Unknown=18, NotChecked=340, Total=1482 [2024-11-13 12:53:18,029 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1897 mSDsluCounter, 26132 mSDsCounter, 0 mSdLazyCounter, 14261 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 28748 SdHoareTripleChecker+Invalid, 14776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 14261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:18,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 28748 Invalid, 14776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 14261 Invalid, 0 Unknown, 0 Unchecked, 28.4s Time] [2024-11-13 12:53:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2024-11-13 12:53:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5705. [2024-11-13 12:53:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 3442 states have (on average 1.8439860546194073) internal successors, (6347), 5695 states have internal predecessors, (6347), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:53:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 10359 transitions. [2024-11-13 12:53:18,454 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 10359 transitions. Word has length 102 [2024-11-13 12:53:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 5705 states and 10359 transitions. [2024-11-13 12:53:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:53:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 10359 transitions. [2024-11-13 12:53:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 12:53:18,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:18,455 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 12:53:18,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:53:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:53:18,655 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:53:18,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -831931924, now seen corresponding path program 1 times [2024-11-13 12:53:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844769654] [2024-11-13 12:53:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:53:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:19,676 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 12:53:19,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844769654] [2024-11-13 12:53:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844769654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:19,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:19,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 12:53:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506966231] [2024-11-13 12:53:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:53:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:53:19,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:53:19,679 INFO L87 Difference]: Start difference. First operand 5705 states and 10359 transitions. Second operand has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 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 12:53:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:29,221 INFO L93 Difference]: Finished difference Result 5744 states and 10404 transitions. [2024-11-13 12:53:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:53:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 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 12:53:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:29,230 INFO L225 Difference]: With dead ends: 5744 [2024-11-13 12:53:29,230 INFO L226 Difference]: Without dead ends: 5744 [2024-11-13 12:53:29,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:53:29,231 INFO L432 NwaCegarLoop]: 2616 mSDtfsCounter, 1893 mSDsluCounter, 11698 mSDsCounter, 0 mSdLazyCounter, 8714 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 14314 SdHoareTripleChecker+Invalid, 9229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 8714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:29,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 14314 Invalid, 9229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 8714 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-13 12:53:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2024-11-13 12:53:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5740. [2024-11-13 12:53:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 3476 states have (on average 1.8365937859608745) internal successors, (6384), 5728 states have internal predecessors, (6384), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:53:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 10398 transitions. [2024-11-13 12:53:29,792 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 10398 transitions. Word has length 105 [2024-11-13 12:53:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:29,792 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 10398 transitions. [2024-11-13 12:53:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 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 12:53:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 10398 transitions. [2024-11-13 12:53:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 12:53:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:29,793 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 12:53:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 12:53:29,793 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:53:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash -831931923, now seen corresponding path program 1 times [2024-11-13 12:53:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843224472] [2024-11-13 12:53:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:53:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:53:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843224472] [2024-11-13 12:53:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843224472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 12:53:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786030698] [2024-11-13 12:53:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:53:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:53:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:53:30,977 INFO L87 Difference]: Start difference. First operand 5740 states and 10398 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:53:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:45,145 INFO L93 Difference]: Finished difference Result 5743 states and 10402 transitions. [2024-11-13 12:53:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:53:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-13 12:53:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:45,152 INFO L225 Difference]: With dead ends: 5743 [2024-11-13 12:53:45,152 INFO L226 Difference]: Without dead ends: 5743 [2024-11-13 12:53:45,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 12:53:45,153 INFO L432 NwaCegarLoop]: 2614 mSDtfsCounter, 1894 mSDsluCounter, 15632 mSDsCounter, 0 mSdLazyCounter, 11181 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 18246 SdHoareTripleChecker+Invalid, 11700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 11181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:45,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 18246 Invalid, 11700 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [519 Valid, 11181 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-13 12:53:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2024-11-13 12:53:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5740. [2024-11-13 12:53:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 3476 states have (on average 1.8360184119677792) internal successors, (6382), 5728 states have internal predecessors, (6382), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:53:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 10396 transitions. [2024-11-13 12:53:45,538 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 10396 transitions. Word has length 105 [2024-11-13 12:53:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:45,538 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 10396 transitions. [2024-11-13 12:53:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:53:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 10396 transitions. [2024-11-13 12:53:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 12:53:45,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:45,539 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] [2024-11-13 12:53:45,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 12:53:45,539 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:53:45,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash -960742282, now seen corresponding path program 1 times [2024-11-13 12:53:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035489863] [2024-11-13 12:53:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:45,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:53:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:46,298 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 12:53:46,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:46,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035489863] [2024-11-13 12:53:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035489863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363082229] [2024-11-13 12:53:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:53:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:53:46,300 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:53:46,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:53:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:46,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 12:53:46,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:46,764 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:53:46,764 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 12:53:46,809 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 12:53:46,911 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 12:53:47,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:53:47,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 12:53:47,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:53:47,202 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 12:53:47,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:53:47,317 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 12:53:47,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:53:47,415 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 12:53:47,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:53:47,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 12:53:47,513 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 12:53:47,597 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-13 12:53:47,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-13 12:53:47,604 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 12:53:47,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:53:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363082229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:48,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:53:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-13 12:53:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461246666] [2024-11-13 12:53:48,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:53:48,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 12:53:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 12:53:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1167, Unknown=51, NotChecked=0, Total=1406 [2024-11-13 12:53:48,631 INFO L87 Difference]: Start difference. First operand 5740 states and 10396 transitions. Second operand has 27 states, 24 states have (on average 6.0) internal successors, (144), 26 states have internal predecessors, (144), 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 12:54:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:11,229 INFO L93 Difference]: Finished difference Result 5742 states and 10400 transitions. [2024-11-13 12:54:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:54:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.0) internal successors, (144), 26 states have internal predecessors, (144), 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 106 [2024-11-13 12:54:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:11,237 INFO L225 Difference]: With dead ends: 5742 [2024-11-13 12:54:11,238 INFO L226 Difference]: Without dead ends: 5742 [2024-11-13 12:54:11,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1451, Unknown=51, NotChecked=0, Total=1722 [2024-11-13 12:54:11,238 INFO L432 NwaCegarLoop]: 2612 mSDtfsCounter, 1881 mSDsluCounter, 21290 mSDsCounter, 0 mSdLazyCounter, 16717 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 23902 SdHoareTripleChecker+Invalid, 17234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 16717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:11,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 23902 Invalid, 17234 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [517 Valid, 16717 Invalid, 0 Unknown, 0 Unchecked, 22.0s Time] [2024-11-13 12:54:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2024-11-13 12:54:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5739. [2024-11-13 12:54:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 3476 states have (on average 1.8354430379746836) internal successors, (6380), 5727 states have internal predecessors, (6380), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:54:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 10394 transitions. [2024-11-13 12:54:11,700 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 10394 transitions. Word has length 106 [2024-11-13 12:54:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 5739 states and 10394 transitions. [2024-11-13 12:54:11,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.0) internal successors, (144), 26 states have internal predecessors, (144), 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 12:54:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 10394 transitions. [2024-11-13 12:54:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 12:54:11,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:11,701 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] [2024-11-13 12:54:11,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:54:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:11,902 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:54:11,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -960742281, now seen corresponding path program 1 times [2024-11-13 12:54:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:54:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84640485] [2024-11-13 12:54:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:54:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:54:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:13,284 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 12:54:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:54:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84640485] [2024-11-13 12:54:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84640485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457772574] [2024-11-13 12:54:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:54:13,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:54:13,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:54:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:13,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 12:54:13,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:13,777 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 12:54:13,797 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:54:13,797 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 12:54:13,862 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 12:54:13,872 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 12:54:14,079 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 12:54:14,089 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 12:54:14,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:54:14,361 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 12:54:14,374 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 12:54:14,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:54:14,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 12:54:14,562 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 12:54:14,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:54:14,687 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 12:54:14,698 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 12:54:14,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:54:14,812 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 12:54:14,817 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 12:54:14,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:54:14,945 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 12:54:14,950 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 12:54:14,981 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 12:54:14,988 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 12:54:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:54:15,062 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 12:54:15,089 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 12:54:15,089 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 12:54:15,097 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 12:54:15,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:16,800 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int)) (v_ArrVal_2842 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2843))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2845))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2842) .cse1 v_ArrVal_2844) .cse2 v_ArrVal_2847) (select (select (store .cse3 .cse2 v_ArrVal_2846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2849))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int)) (v_ArrVal_2842 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2849 (Array Int Int)) (v_ArrVal_2848 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2850 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2843))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2845))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2846))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2842) .cse6 v_ArrVal_2844) .cse7 v_ArrVal_2847) .cse8 v_ArrVal_2849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2850) (select (select (store .cse9 .cse8 v_ArrVal_2848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-13 12:54:16,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int)) (v_ArrVal_2842 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2855))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2843))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2845))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2856) .cse0 v_ArrVal_2842) .cse1 v_ArrVal_2844) .cse2 v_ArrVal_2847) (select (select (store .cse3 .cse2 v_ArrVal_2846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2849))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2846 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2843 (Array Int Int)) (v_ArrVal_2842 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2849 (Array Int Int)) (v_ArrVal_2848 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2850 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2855))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2843))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2845))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2846))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2856) .cse7 v_ArrVal_2842) .cse8 v_ArrVal_2844) .cse9 v_ArrVal_2847) .cse10 v_ArrVal_2849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2850) (select (select (store .cse11 .cse10 v_ArrVal_2848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-13 12:54:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457772574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:16,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:54:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2024-11-13 12:54:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124432998] [2024-11-13 12:54:16,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:54:16,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 12:54:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:54:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 12:54:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1251, Unknown=49, NotChecked=150, Total=1640 [2024-11-13 12:54:16,917 INFO L87 Difference]: Start difference. First operand 5739 states and 10394 transitions. Second operand has 29 states, 26 states have (on average 5.5) internal successors, (143), 28 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 12:54:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:50,371 INFO L93 Difference]: Finished difference Result 5741 states and 10398 transitions. [2024-11-13 12:54:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:54:50,371 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.5) internal successors, (143), 28 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 106 [2024-11-13 12:54:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:50,378 INFO L225 Difference]: With dead ends: 5741 [2024-11-13 12:54:50,378 INFO L226 Difference]: Without dead ends: 5741 [2024-11-13 12:54:50,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=224, Invalid=1539, Unknown=51, NotChecked=166, Total=1980 [2024-11-13 12:54:50,379 INFO L432 NwaCegarLoop]: 2612 mSDtfsCounter, 1884 mSDsluCounter, 22978 mSDsCounter, 0 mSdLazyCounter, 17482 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 25590 SdHoareTripleChecker+Invalid, 18002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 17482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:50,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 25590 Invalid, 18002 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [520 Valid, 17482 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2024-11-13 12:54:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2024-11-13 12:54:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5703. [2024-11-13 12:54:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 3442 states have (on average 1.8428239395700174) internal successors, (6343), 5693 states have internal predecessors, (6343), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:54:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 10355 transitions. [2024-11-13 12:54:51,018 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 10355 transitions. Word has length 106 [2024-11-13 12:54:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 5703 states and 10355 transitions. [2024-11-13 12:54:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.5) internal successors, (143), 28 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 12:54:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 10355 transitions. [2024-11-13 12:54:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 12:54:51,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:51,019 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 12:54:51,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:54:51,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 12:54:51,219 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:54:51,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2121985612, now seen corresponding path program 1 times [2024-11-13 12:54:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:54:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908437912] [2024-11-13 12:54:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:54:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:54:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:51,812 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 12:54:51,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:54:51,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908437912] [2024-11-13 12:54:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908437912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:54:51,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:54:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 12:54:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526544279] [2024-11-13 12:54:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:51,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 12:54:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:54:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:54:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:54:51,814 INFO L87 Difference]: Start difference. First operand 5703 states and 10355 transitions. Second operand has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 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 12:55:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:01,861 INFO L93 Difference]: Finished difference Result 5748 states and 10406 transitions. [2024-11-13 12:55:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:55:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 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 12:55:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:01,871 INFO L225 Difference]: With dead ends: 5748 [2024-11-13 12:55:01,871 INFO L226 Difference]: Without dead ends: 5748 [2024-11-13 12:55:01,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:55:01,872 INFO L432 NwaCegarLoop]: 2615 mSDtfsCounter, 1920 mSDsluCounter, 14847 mSDsCounter, 0 mSdLazyCounter, 8528 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 17462 SdHoareTripleChecker+Invalid, 9046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 8528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:01,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 17462 Invalid, 9046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 8528 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-13 12:55:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2024-11-13 12:55:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 5744. [2024-11-13 12:55:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3482 states have (on average 1.8340034462952326) internal successors, (6386), 5732 states have internal predecessors, (6386), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:55:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10400 transitions. [2024-11-13 12:55:02,369 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10400 transitions. Word has length 108 [2024-11-13 12:55:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:02,370 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10400 transitions. [2024-11-13 12:55:02,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 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 12:55:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10400 transitions. [2024-11-13 12:55:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 12:55:02,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:02,371 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 12:55:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 12:55:02,371 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:55:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2121985611, now seen corresponding path program 1 times [2024-11-13 12:55:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:55:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918535707] [2024-11-13 12:55:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:55:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:55:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:03,873 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 12:55:03,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:55:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918535707] [2024-11-13 12:55:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918535707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:55:03,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:55:03,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 12:55:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248374359] [2024-11-13 12:55:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:03,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:55:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:55:03,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:55:03,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:55:03,875 INFO L87 Difference]: Start difference. First operand 5744 states and 10400 transitions. Second operand has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 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 12:55:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:22,014 INFO L93 Difference]: Finished difference Result 5747 states and 10404 transitions. [2024-11-13 12:55:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:55:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 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 12:55:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:22,023 INFO L225 Difference]: With dead ends: 5747 [2024-11-13 12:55:22,023 INFO L226 Difference]: Without dead ends: 5747 [2024-11-13 12:55:22,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-13 12:55:22,024 INFO L432 NwaCegarLoop]: 2613 mSDtfsCounter, 1893 mSDsluCounter, 16144 mSDsCounter, 0 mSdLazyCounter, 10682 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 18757 SdHoareTripleChecker+Invalid, 11198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 10682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:22,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 18757 Invalid, 11198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 10682 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2024-11-13 12:55:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2024-11-13 12:55:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5744. [2024-11-13 12:55:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3482 states have (on average 1.8334290637564619) internal successors, (6384), 5732 states have internal predecessors, (6384), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:55:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10398 transitions. [2024-11-13 12:55:22,473 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10398 transitions. Word has length 108 [2024-11-13 12:55:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:22,473 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10398 transitions. [2024-11-13 12:55:22,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 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 12:55:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10398 transitions. [2024-11-13 12:55:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 12:55:22,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:22,474 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 12:55:22,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 12:55:22,474 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:55:22,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 189401834, now seen corresponding path program 1 times [2024-11-13 12:55:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:55:22,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624699371] [2024-11-13 12:55:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:55:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:55:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:22,876 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 12:55:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:55:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624699371] [2024-11-13 12:55:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624699371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:55:22,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:55:22,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:55:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199554148] [2024-11-13 12:55:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:22,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:55:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:55:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:55:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:55:22,878 INFO L87 Difference]: Start difference. First operand 5744 states and 10398 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 12:55:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:30,881 INFO L93 Difference]: Finished difference Result 5746 states and 10402 transitions. [2024-11-13 12:55:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:55:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 109 [2024-11-13 12:55:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:30,891 INFO L225 Difference]: With dead ends: 5746 [2024-11-13 12:55:30,891 INFO L226 Difference]: Without dead ends: 5746 [2024-11-13 12:55:30,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:55:30,891 INFO L432 NwaCegarLoop]: 2922 mSDtfsCounter, 13 mSDsluCounter, 10387 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13309 SdHoareTripleChecker+Invalid, 4277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:30,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13309 Invalid, 4277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3774 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-13 12:55:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2024-11-13 12:55:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 5743. [2024-11-13 12:55:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3482 states have (on average 1.832854681217691) internal successors, (6382), 5731 states have internal predecessors, (6382), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 12:55:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10396 transitions. [2024-11-13 12:55:31,291 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10396 transitions. Word has length 109 [2024-11-13 12:55:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:31,291 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10396 transitions. [2024-11-13 12:55:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 12:55:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10396 transitions. [2024-11-13 12:55:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 12:55:31,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:31,291 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 12:55:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 12:55:31,292 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:55:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 189401835, now seen corresponding path program 1 times [2024-11-13 12:55:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:55:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413973208] [2024-11-13 12:55:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:55:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:55:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:33,415 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 12:55:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:55:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413973208] [2024-11-13 12:55:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413973208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841958822] [2024-11-13 12:55:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:33,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:55:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:55:33,418 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:55:33,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:55:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:33,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 12:55:33,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:33,947 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 12:55:33,948 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 12:55:33,960 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 12:55:34,001 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 12:55:34,014 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 12:55:34,181 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 12:55:34,187 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 12:55:34,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55: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 73 treesize of output 66 [2024-11-13 12:55:34,509 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 12:55:34,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55:34,715 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 12:55:34,731 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 12:55:34,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55:34,857 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 12:55:34,867 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 12:55:34,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55:34,978 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 12:55:34,987 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 12:55:35,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55:35,138 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 12:55:35,143 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 12:55:35,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:55:35,295 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 12:55:35,321 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-13 12:55:35,321 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 12:55:35,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:55:35,407 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 12:55:35,416 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 12:55:35,464 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 12:55:35,471 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 12:55:35,510 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 12:55:35,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:35,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3364 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 12:55:36,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (or (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3362 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3358))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_3361))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3359) .cse0 v_ArrVal_3360) .cse1 v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3362) (select (select (store .cse3 .cse1 v_ArrVal_3363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3358))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3359) .cse5 v_ArrVal_3360) (select (select (store .cse6 .cse5 v_ArrVal_3361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3364))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-13 12:55:36,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3356))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3358))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3357) .cse0 v_ArrVal_3359) .cse1 v_ArrVal_3360) (select (select (store .cse2 .cse1 v_ArrVal_3361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3364))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (or (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3362 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3356))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3358))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3361))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3357) .cse5 v_ArrVal_3359) .cse6 v_ArrVal_3360) .cse7 v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3362) (select (select (store .cse8 .cse7 v_ArrVal_3363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-13 12:55:36,649 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3356))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3358))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3357) .cse1 v_ArrVal_3359) .cse2 v_ArrVal_3360) (select (select (store .cse3 .cse2 v_ArrVal_3361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3364))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3362 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3356))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3358))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3361))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3357) .cse6 v_ArrVal_3359) .cse7 v_ArrVal_3360) .cse8 v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3362) (select (select (store .cse9 .cse8 v_ArrVal_3363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-13 12:55:36,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3354))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3356))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3358))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3355) .cse0 v_ArrVal_3357) .cse1 v_ArrVal_3359) .cse2 v_ArrVal_3360) (select (select (store .cse3 .cse2 v_ArrVal_3361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3364))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3360 (Array Int Int)) (v_ArrVal_3361 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_ArrVal_3358 (Array Int Int)) (v_ArrVal_3359 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3362 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3354))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3356))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3358))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3361))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3355) .cse7 v_ArrVal_3357) .cse8 v_ArrVal_3359) .cse9 v_ArrVal_3360) .cse10 v_ArrVal_3364) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3362) (select (select (store .cse11 .cse10 v_ArrVal_3363) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-13 12:56:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841958822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:01,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:56:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2024-11-13 12:56:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869695274] [2024-11-13 12:56:01,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:56:01,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 12:56:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:56:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 12:56:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1702, Unknown=43, NotChecked=450, Total=2450 [2024-11-13 12:56:01,221 INFO L87 Difference]: Start difference. First operand 5743 states and 10396 transitions. Second operand has 36 states, 33 states have (on average 6.363636363636363) internal successors, (210), 35 states have internal predecessors, (210), 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 12:59:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:08,220 INFO L93 Difference]: Finished difference Result 5775 states and 10436 transitions. [2024-11-13 12:59:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:59:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 6.363636363636363) internal successors, (210), 35 states have internal predecessors, (210), 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 109 [2024-11-13 12:59:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:08,228 INFO L225 Difference]: With dead ends: 5775 [2024-11-13 12:59:08,228 INFO L226 Difference]: Without dead ends: 5775 [2024-11-13 12:59:08,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=433, Invalid=2849, Unknown=44, NotChecked=580, Total=3906 [2024-11-13 12:59:08,229 INFO L432 NwaCegarLoop]: 2604 mSDtfsCounter, 5588 mSDsluCounter, 36429 mSDsCounter, 0 mSdLazyCounter, 26408 mSolverCounterSat, 1544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 178.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6090 SdHoareTripleChecker+Valid, 39033 SdHoareTripleChecker+Invalid, 27952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 1544 IncrementalHoareTripleChecker+Valid, 26408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 182.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:08,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6090 Valid, 39033 Invalid, 27952 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [1544 Valid, 26408 Invalid, 0 Unknown, 0 Unchecked, 182.3s Time] [2024-11-13 12:59:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2024-11-13 12:59:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5706. [2024-11-13 12:59:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5706 states, 3446 states have (on average 1.8409750435287289) internal successors, (6344), 5695 states have internal predecessors, (6344), 2007 states have call successors, (2007), 5 states have call predecessors, (2007), 4 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2024-11-13 12:59:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5706 states to 5706 states and 10356 transitions. [2024-11-13 12:59:08,671 INFO L78 Accepts]: Start accepts. Automaton has 5706 states and 10356 transitions. Word has length 109 [2024-11-13 12:59:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 5706 states and 10356 transitions. [2024-11-13 12:59:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 6.363636363636363) internal successors, (210), 35 states have internal predecessors, (210), 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 12:59:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 10356 transitions. [2024-11-13 12:59:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 12:59:08,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:08,672 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, 1, 1] [2024-11-13 12:59:08,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 12:59:08,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-13 12:59:08,873 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 12:59:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1550934035, now seen corresponding path program 1 times [2024-11-13 12:59:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801816438] [2024-11-13 12:59:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:59:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:11,761 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 12:59:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801816438] [2024-11-13 12:59:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801816438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 12:59:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562994397] [2024-11-13 12:59:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:11,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:59:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:59:11,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:59:11,762 INFO L87 Difference]: Start difference. First operand 5706 states and 10356 transitions. Second operand has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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:00:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:27,618 INFO L93 Difference]: Finished difference Result 5794 states and 10464 transitions. [2024-11-13 13:00:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:00:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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 111 [2024-11-13 13:00:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:27,628 INFO L225 Difference]: With dead ends: 5794 [2024-11-13 13:00:27,629 INFO L226 Difference]: Without dead ends: 5794 [2024-11-13 13:00:27,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:00:27,630 INFO L432 NwaCegarLoop]: 2621 mSDtfsCounter, 1948 mSDsluCounter, 18632 mSDsCounter, 0 mSdLazyCounter, 10807 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 21253 SdHoareTripleChecker+Invalid, 11327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 10807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:27,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2452 Valid, 21253 Invalid, 11327 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [520 Valid, 10807 Invalid, 0 Unknown, 0 Unchecked, 74.2s Time] [2024-11-13 13:00:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2024-11-13 13:00:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 5753. [2024-11-13 13:00:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 3492 states have (on average 1.8307560137457044) internal successors, (6393), 5740 states have internal predecessors, (6393), 2007 states have call successors, (2007), 5 states have call predecessors, (2007), 5 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 13:00:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 10407 transitions. [2024-11-13 13:00:28,552 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 10407 transitions. Word has length 111 [2024-11-13 13:00:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:28,553 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 10407 transitions. [2024-11-13 13:00:28,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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:00:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 10407 transitions. [2024-11-13 13:00:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:00:28,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:28,554 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, 1, 1] [2024-11-13 13:00:28,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 13:00:28,554 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 13:00:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1550934036, now seen corresponding path program 1 times [2024-11-13 13:00:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303432012] [2024-11-13 13:00:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:00:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:32,023 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:00:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303432012] [2024-11-13 13:00:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303432012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:00:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345217211] [2024-11-13 13:00:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:32,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:00:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:00:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:32,025 INFO L87 Difference]: Start difference. First operand 5753 states and 10407 transitions. Second operand has 11 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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:01:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:34,809 INFO L93 Difference]: Finished difference Result 5780 states and 10440 transitions. [2024-11-13 13:01:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:01:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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 111 [2024-11-13 13:01:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:34,821 INFO L225 Difference]: With dead ends: 5780 [2024-11-13 13:01:34,821 INFO L226 Difference]: Without dead ends: 5780 [2024-11-13 13:01:34,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:01:34,822 INFO L432 NwaCegarLoop]: 2608 mSDtfsCounter, 1935 mSDsluCounter, 13197 mSDsCounter, 0 mSdLazyCounter, 7646 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 15805 SdHoareTripleChecker+Invalid, 8158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:34,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2437 Valid, 15805 Invalid, 8158 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 7646 Invalid, 0 Unknown, 0 Unchecked, 61.3s Time] [2024-11-13 13:01:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2024-11-13 13:01:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5752. [2024-11-13 13:01:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3492 states have (on average 1.829610538373425) internal successors, (6389), 5739 states have internal predecessors, (6389), 2007 states have call successors, (2007), 5 states have call predecessors, (2007), 5 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2024-11-13 13:01:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10403 transitions. [2024-11-13 13:01:35,546 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10403 transitions. Word has length 111 [2024-11-13 13:01:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:35,546 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10403 transitions. [2024-11-13 13:01:35,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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:01:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10403 transitions. [2024-11-13 13:01:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 13:01:35,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:35,547 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, 1, 1, 1] [2024-11-13 13:01:35,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 13:01:35,547 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-13 13:01:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1116318947, now seen corresponding path program 1 times [2024-11-13 13:01:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834354053] [2024-11-13 13:01:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:01:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:39,093 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:01:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834354053] [2024-11-13 13:01:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834354053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274639458] [2024-11-13 13:01:39,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:39,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:39,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:39,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6e6d529-4e73-4f18-ac29-d525981dc938/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:01:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:39,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 13:01:39,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:40,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:01:40,523 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:01:40,567 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:01:40,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:40,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 13:01:41,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:41,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 13:01:41,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 13:01:42,075 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:42,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 13:01:42,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:42,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 13:01:42,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:42,793 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:01:43,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 13:01:43,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:01:43,330 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:01:43,345 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:01:43,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:44,120 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 13:01:44,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-13 13:01:44,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3787)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3788))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 13:01:45,412 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3786))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3787)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:01:45,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3786))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3787)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3788))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:01:45,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3785 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3785))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3786)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3787)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:01:45,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3785 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3785))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3786)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3787)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:01:45,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array Int Int)) (v_ArrVal_3785 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3784))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3785)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3786)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3787)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 13:01:45,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3784 (Array Int Int)) (v_ArrVal_3785 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3784))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3785)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3786)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3787)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3788))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:01:45,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3792 (Array Int Int)) (v_ArrVal_3784 (Array Int Int)) (v_ArrVal_3785 (Array Int Int)) (v_ArrVal_3786 (Array Int Int)) (v_ArrVal_3787 (Array Int Int)) (v_ArrVal_3788 (Array Int Int)) (v_ArrVal_3789 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3792))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3784)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3785)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3786)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3787)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3788))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 13:01:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274639458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:45,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:01:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 24 [2024-11-13 13:01:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847850230] [2024-11-13 13:01:45,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:01:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:01:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=732, Unknown=40, NotChecked=504, Total=1406 [2024-11-13 13:01:45,997 INFO L87 Difference]: Start difference. First operand 5752 states and 10403 transitions. Second operand has 25 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 states have internal predecessors, (136), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)