./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:50:34,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:34,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:34,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:34,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:34,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:34,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:34,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:34,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:34,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:34,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:34,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:34,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:34,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:34,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:34,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:34,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:34,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:34,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:34,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:34,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:34,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:34,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:34,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:34,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:34,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:34,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:34,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:34,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:34,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:34,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:34,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:34,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:34,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:34,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:34,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:34,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:34,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:34,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:34,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:34,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:34,097 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:50:34,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:34,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:34,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:34,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:34,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:34,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:34,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:34,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:34,140 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:34,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:34,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:50:34,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:50:34,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:34,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:50:34,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:34,143 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:50:34,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:50:34,143 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:50:34,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:34,143 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:50:34,144 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:50:34,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:34,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:34,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:34,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:34,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:34,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:34,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:34,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:34,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:34,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2022-11-02 20:50:34,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:34,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:34,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:34,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:34,544 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:34,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-11-02 20:50:34,629 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/data/2354e4a21/5b20be91c23c456d85527d6870911382/FLAG643c69097 [2022-11-02 20:50:35,257 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:35,258 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-11-02 20:50:35,272 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/data/2354e4a21/5b20be91c23c456d85527d6870911382/FLAG643c69097 [2022-11-02 20:50:35,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/data/2354e4a21/5b20be91c23c456d85527d6870911382 [2022-11-02 20:50:35,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:35,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:35,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:35,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:35,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:35,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:35,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f9f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35, skipping insertion in model container [2022-11-02 20:50:35,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:35,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:35,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:35,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:35,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:35,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:35,969 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:35,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35 WrapperNode [2022-11-02 20:50:35,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:35,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:35,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:35,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:35,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:35,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,013 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-11-02 20:50:36,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:36,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:36,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:36,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:36,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:36,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:36,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:36,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:36,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (1/1) ... [2022-11-02 20:50:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:36,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:36,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:50:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:50:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:50:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:36,289 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:36,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:36,673 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:36,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:36,681 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:50:36,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:36 BoogieIcfgContainer [2022-11-02 20:50:36,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:36,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:36,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:36,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:36,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:35" (1/3) ... [2022-11-02 20:50:36,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd291f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:36, skipping insertion in model container [2022-11-02 20:50:36,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:35" (2/3) ... [2022-11-02 20:50:36,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd291f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:36, skipping insertion in model container [2022-11-02 20:50:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:36" (3/3) ... [2022-11-02 20:50:36,697 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-11-02 20:50:36,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:36,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-02 20:50:36,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:36,810 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@11423063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:36,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-02 20:50:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 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) [2022-11-02 20:50:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:50:36,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:36,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:50:36,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:50:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976365394] [2022-11-02 20:50:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:37,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976365394] [2022-11-02 20:50:37,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976365394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:37,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:37,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180329954] [2022-11-02 20:50:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:37,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:37,249 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 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) 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) [2022-11-02 20:50:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:37,416 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-02 20:50:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:37,419 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 [2022-11-02 20:50:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:37,430 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:50:37,430 INFO L226 Difference]: Without dead ends: 59 [2022-11-02 20:50:37,433 INFO L412 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 [2022-11-02 20:50:37,439 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:37,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-02 20:50:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-11-02 20:50:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 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) [2022-11-02 20:50:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-02 20:50:37,490 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-11-02 20:50:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:37,491 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-02 20:50:37,491 INFO L496 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) [2022-11-02 20:50:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-02 20:50:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:50:37,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:37,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:50:37,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:37,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:50:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:37,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681303387] [2022-11-02 20:50:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:37,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681303387] [2022-11-02 20:50:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681303387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:37,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:37,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:37,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252187449] [2022-11-02 20:50:37,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:37,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:37,625 INFO L87 Difference]: Start difference. First operand 53 states and 58 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) [2022-11-02 20:50:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:37,730 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-02 20:50:37,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:37,731 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 [2022-11-02 20:50:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:37,732 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:50:37,732 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:50:37,733 INFO L412 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 [2022-11-02 20:50:37,734 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:37,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:50:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-11-02 20:50:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 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) [2022-11-02 20:50:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-02 20:50:37,741 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-11-02 20:50:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:37,741 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-02 20:50:37,742 INFO L496 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) [2022-11-02 20:50:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-02 20:50:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:50:37,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:37,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:37,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:37,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-11-02 20:50:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823140801] [2022-11-02 20:50:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823140801] [2022-11-02 20:50:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823140801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:37,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:37,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524428728] [2022-11-02 20:50:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:37,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:37,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:37,868 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-02 20:50:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,026 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-11-02 20:50:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:38,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 [2022-11-02 20:50:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,027 INFO L225 Difference]: With dead ends: 58 [2022-11-02 20:50:38,028 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:50:38,028 INFO L412 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 [2022-11-02 20:50:38,029 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:50:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-11-02 20:50:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-11-02 20:50:38,036 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-11-02 20:50:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,036 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-11-02 20:50:38,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-02 20:50:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-11-02 20:50:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:50:38,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:38,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-11-02 20:50:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393922129] [2022-11-02 20:50:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393922129] [2022-11-02 20:50:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393922129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:38,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:38,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970791714] [2022-11-02 20:50:38,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:38,307 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-02 20:50:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,432 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-11-02 20:50:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 [2022-11-02 20:50:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,434 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:50:38,434 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:50:38,435 INFO L412 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 [2022-11-02 20:50:38,436 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:50:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-11-02 20:50:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 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) [2022-11-02 20:50:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-11-02 20:50:38,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-11-02 20:50:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,445 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-11-02 20:50:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-02 20:50:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-11-02 20:50:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:50:38,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:38,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-11-02 20:50:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072085416] [2022-11-02 20:50:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072085416] [2022-11-02 20:50:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072085416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:38,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:38,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131824320] [2022-11-02 20:50:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:38,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:38,523 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,602 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-11-02 20:50:38,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:50:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,604 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:50:38,604 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:50:38,604 INFO L412 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 [2022-11-02 20:50:38,606 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 58 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:50:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-11-02 20:50:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 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) [2022-11-02 20:50:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-11-02 20:50:38,613 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-11-02 20:50:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,614 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-11-02 20:50:38,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-11-02 20:50:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:50:38,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:38,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-11-02 20:50:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433924167] [2022-11-02 20:50:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:38,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433924167] [2022-11-02 20:50:38,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433924167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:38,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:38,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918278953] [2022-11-02 20:50:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:38,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:38,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:38,819 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,891 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-11-02 20:50:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:50:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,892 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:50:38,892 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:50:38,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:38,893 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:50:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-02 20:50:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-02 20:50:38,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-11-02 20:50:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,900 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-02 20:50:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-02 20:50:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:50:38,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:38,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-11-02 20:50:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007330384] [2022-11-02 20:50:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:39,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007330384] [2022-11-02 20:50:39,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007330384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:39,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:39,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440038117] [2022-11-02 20:50:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:39,286 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-11-02 20:50:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:39,449 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-11-02 20:50:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-11-02 20:50:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:39,454 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:50:39,454 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:50:39,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:39,458 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:50:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-11-02 20:50:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-11-02 20:50:39,474 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-11-02 20:50:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:39,474 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-11-02 20:50:39,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-11-02 20:50:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-11-02 20:50:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:50:39,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:39,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:39,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:50:39,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-11-02 20:50:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:39,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702052347] [2022-11-02 20:50:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702052347] [2022-11-02 20:50:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702052347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:39,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:50:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872446046] [2022-11-02 20:50:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:39,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:39,598 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-02 20:50:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:39,700 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-02 20:50:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-02 20:50:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:39,704 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:50:39,704 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:50:39,705 INFO L412 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 [2022-11-02 20:50:39,708 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:39,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 60 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:50:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-11-02 20:50:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 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) [2022-11-02 20:50:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-11-02 20:50:39,724 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-11-02 20:50:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:39,724 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-11-02 20:50:39,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-11-02 20:50:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-11-02 20:50:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:50:39,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:39,726 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:39,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:50:39,726 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-11-02 20:50:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:39,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091839869] [2022-11-02 20:50:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:40,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091839869] [2022-11-02 20:50:40,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091839869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470628998] [2022-11-02 20:50:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:40,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:40,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:50:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:40,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:50:40,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:40,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:50:40,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:50:40,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:40,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:50:40,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:40,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:50:40,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:40,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:50:40,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:40,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:50:40,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:40,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:50:40,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:40,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:40,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-02 20:50:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:40,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:49,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:50:49,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:49,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:49,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-02 20:50:49,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:50:49,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:49,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470628998] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:49,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:49,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-11-02 20:50:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421811776] [2022-11-02 20:50:49,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:50:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:50:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2022-11-02 20:50:49,518 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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) [2022-11-02 20:50:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:49,873 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-11-02 20:50:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:50:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 [2022-11-02 20:50:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:49,875 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:50:49,875 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:50:49,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=104, Invalid=311, Unknown=5, NotChecked=0, Total=420 [2022-11-02 20:50:49,876 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:49,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 223 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 150 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-11-02 20:50:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:50:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-11-02 20:50:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 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) [2022-11-02 20:50:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-11-02 20:50:49,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-11-02 20:50:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:49,882 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-11-02 20:50:49,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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) [2022-11-02 20:50:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-11-02 20:50:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:50:49,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:49,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:49,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:50,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:50,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-11-02 20:50:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:50,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950122870] [2022-11-02 20:50:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:50,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950122870] [2022-11-02 20:50:50,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950122870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785826975] [2022-11-02 20:50:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:50,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:50,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:50:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:50:50,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:50,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:50:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:50,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:50,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785826975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:50,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:50,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:50:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572886241] [2022-11-02 20:50:50,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:50,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:50,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:50,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:50,425 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-11-02 20:50:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:50,545 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-11-02 20:50:50,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 19 [2022-11-02 20:50:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:50,547 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:50:50,547 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:50:50,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:50,548 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:50,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-11-02 20:50:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:50:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 20:50:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 states have internal predecessors, (87), 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) [2022-11-02 20:50:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-11-02 20:50:50,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-11-02 20:50:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:50,553 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-11-02 20:50:50,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-11-02 20:50:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-11-02 20:50:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:50:50,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:50,554 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:50,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:50,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:50:50,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-11-02 20:50:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:50,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360665362] [2022-11-02 20:50:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360665362] [2022-11-02 20:50:50,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360665362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:50,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:50,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261176403] [2022-11-02 20:50:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:50,885 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-11-02 20:50:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:50,987 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-11-02 20:50:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-11-02 20:50:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:50,988 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:50:50,988 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:50:50,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:50,989 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:50,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:50:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-11-02 20:50:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-11-02 20:50:50,993 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-11-02 20:50:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:50,993 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-11-02 20:50:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-11-02 20:50:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-11-02 20:50:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:50:50,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:50,995 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:50,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:50:50,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-11-02 20:50:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079559348] [2022-11-02 20:50:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:51,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:51,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079559348] [2022-11-02 20:50:51,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079559348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:51,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:51,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949912918] [2022-11-02 20:50:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:51,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:51,351 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-11-02 20:50:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:51,561 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-11-02 20:50:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:50:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2022-11-02 20:50:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:51,562 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:50:51,562 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:50:51,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:50:51,563 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:51,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:50:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-11-02 20:50:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-02 20:50:51,567 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-11-02 20:50:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:51,567 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-02 20:50:51,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-11-02 20:50:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-02 20:50:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:50:51,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:51,568 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:51,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:50:51,569 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-11-02 20:50:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:51,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713110436] [2022-11-02 20:50:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:52,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713110436] [2022-11-02 20:50:52,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713110436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:52,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:52,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695104416] [2022-11-02 20:50:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:52,021 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-11-02 20:50:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:52,282 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-02 20:50:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:50:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2022-11-02 20:50:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:52,283 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:50:52,283 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:50:52,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:50:52,288 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:52,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 125 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:50:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:50:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-11-02 20:50:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 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) [2022-11-02 20:50:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-02 20:50:52,304 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-11-02 20:50:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:52,304 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-02 20:50:52,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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) [2022-11-02 20:50:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-02 20:50:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:50:52,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:52,309 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:50:52,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-11-02 20:50:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:52,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661252125] [2022-11-02 20:50:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:52,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661252125] [2022-11-02 20:50:52,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661252125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:52,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:52,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482609396] [2022-11-02 20:50:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:52,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:52,653 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-02 20:50:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:52,823 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-02 20:50:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:50:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2022-11-02 20:50:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:52,824 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:50:52,824 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:50:52,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:50:52,825 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:52,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 74 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:50:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:50:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-11-02 20:50:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 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) [2022-11-02 20:50:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-11-02 20:50:52,828 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-11-02 20:50:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:52,828 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-11-02 20:50:52,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-02 20:50:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-11-02 20:50:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:50:52,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:52,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:52,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:50:52,830 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:50:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-11-02 20:50:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:52,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557110324] [2022-11-02 20:50:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:52,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:53,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557110324] [2022-11-02 20:50:53,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557110324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:53,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073833257] [2022-11-02 20:50:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:53,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:53,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:53,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:50:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:50:53,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:53,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:50:53,288 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:50:53,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:50:53,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:50:53,381 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:50:53,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:50:53,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:50:53,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:50:53,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:53,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:53,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:50:53,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:50:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:53,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:56,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:56,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 63 [2022-11-02 20:50:56,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_1) v_prenex_3)))))) is different from false [2022-11-02 20:50:56,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:56,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-02 20:50:56,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-11-02 20:50:56,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:56,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:50:56,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 38 [2022-11-02 20:50:56,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:50:56,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:50:56,565 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:50:56,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-11-02 20:50:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:56,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073833257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:56,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:56,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2022-11-02 20:50:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084054827] [2022-11-02 20:50:56,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:56,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:50:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:50:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=441, Unknown=2, NotChecked=42, Total=552 [2022-11-02 20:50:56,645 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-02 20:50:57,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2022-11-02 20:50:58,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8)) (.cse1 (select .cse4 0)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse3) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_main_~y~0#1.base|)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-11-02 20:50:59,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_494 Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_20| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_494) |v_ULTIMATE.start_main_~list~0#1.offset_20|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_20| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_20|)))) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_1) v_prenex_3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-11-02 20:50:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:59,819 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-02 20:50:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:50:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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 26 [2022-11-02 20:50:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:59,821 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:50:59,821 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:50:59,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=276, Invalid=1141, Unknown=5, NotChecked=300, Total=1722 [2022-11-02 20:50:59,822 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 205 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:59,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 150 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 398 Invalid, 0 Unknown, 110 Unchecked, 0.4s Time] [2022-11-02 20:50:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:50:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-11-02 20:50:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 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) [2022-11-02 20:50:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-02 20:50:59,825 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-11-02 20:50:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:59,826 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-02 20:50:59,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-02 20:50:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-02 20:50:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:50:59,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:59,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:59,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:00,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:51:00,037 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-11-02 20:51:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:00,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303359595] [2022-11-02 20:51:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:00,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303359595] [2022-11-02 20:51:00,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303359595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:00,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561614759] [2022-11-02 20:51:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:00,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:00,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:51:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:00,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 20:51:00,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:00,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:00,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:00,668 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:00,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:00,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:51:00,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:00,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:00,763 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:00,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-11-02 20:51:00,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:51:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:00,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:51:00,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:00,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:51:00,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:00,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:51:00,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:00,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:51:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:00,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:06,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (v_ArrVal_589 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_589) |v_ULTIMATE.start_main_~list~0#1.offset_24|))))) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)))))) is different from false [2022-11-02 20:51:06,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:06,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2022-11-02 20:51:06,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:06,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-11-02 20:51:06,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 68 [2022-11-02 20:51:06,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 120 [2022-11-02 20:51:06,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:06,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 56 [2022-11-02 20:51:06,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-02 20:51:06,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:06,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 84 [2022-11-02 20:51:06,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-11-02 20:51:06,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:06,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:51:06,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-02 20:51:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:06,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:06,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-02 20:51:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:06,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561614759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:06,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:06,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-11-02 20:51:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146923949] [2022-11-02 20:51:06,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:51:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:51:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=437, Unknown=3, NotChecked=42, Total=552 [2022-11-02 20:51:06,699 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 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) [2022-11-02 20:51:07,977 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int)) (v_ArrVal_589 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_589) |v_ULTIMATE.start_main_~list~0#1.offset_24|))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_24| Int)) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_588) |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_24|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_24| |c_ULTIMATE.start_main_~y~0#1.offset|)))))) is different from false [2022-11-02 20:51:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:09,285 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2022-11-02 20:51:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:51:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 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 26 [2022-11-02 20:51:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:09,286 INFO L225 Difference]: With dead ends: 154 [2022-11-02 20:51:09,286 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:51:09,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=242, Invalid=1244, Unknown=4, NotChecked=150, Total=1640 [2022-11-02 20:51:09,288 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 99 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:09,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 500 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 685 Invalid, 0 Unknown, 363 Unchecked, 0.6s Time] [2022-11-02 20:51:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:51:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2022-11-02 20:51:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 107 states have internal predecessors, (127), 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) [2022-11-02 20:51:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2022-11-02 20:51:09,299 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 26 [2022-11-02 20:51:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:09,300 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2022-11-02 20:51:09,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 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) [2022-11-02 20:51:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-11-02 20:51:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:51:09,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:09,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:09,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:09,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:09,517 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 94520065, now seen corresponding path program 1 times [2022-11-02 20:51:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401538325] [2022-11-02 20:51:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401538325] [2022-11-02 20:51:10,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401538325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:10,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783417802] [2022-11-02 20:51:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:10,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:10,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:51:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:10,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:51:10,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:10,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:10,262 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:10,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:10,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:10,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:10,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-11-02 20:51:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:10,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:51:10,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783417802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:10,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:51:10,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-11-02 20:51:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318311523] [2022-11-02 20:51:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:10,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:51:10,398 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:10,673 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-11-02 20:51:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:51:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:10,674 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:51:10,674 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:51:10,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:51:10,675 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:10,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 143 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:51:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:51:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2022-11-02 20:51:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.3125) internal successors, (126), 107 states have internal predecessors, (126), 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) [2022-11-02 20:51:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-11-02 20:51:10,679 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 27 [2022-11-02 20:51:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:10,679 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-11-02 20:51:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-11-02 20:51:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:51:10,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:10,680 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:10,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:10,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:51:10,881 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-11-02 20:51:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938116024] [2022-11-02 20:51:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938116024] [2022-11-02 20:51:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938116024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306424910] [2022-11-02 20:51:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:11,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:11,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:11,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:51:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:11,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:51:11,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:11,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:11,336 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:11,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:51:11,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:51:11,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:11,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-11-02 20:51:11,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:11,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 [2022-11-02 20:51:11,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:11,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:11,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-11-02 20:51:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:11,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:12,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) is different from false [2022-11-02 20:51:12,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:12,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-02 20:51:12,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-11-02 20:51:12,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:12,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:12,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 38 [2022-11-02 20:51:12,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:12,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:51:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:12,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306424910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:12,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:12,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2022-11-02 20:51:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644667873] [2022-11-02 20:51:12,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:12,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:51:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:51:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-11-02 20:51:12,699 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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) [2022-11-02 20:51:13,286 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1)) is different from false [2022-11-02 20:51:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:13,762 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2022-11-02 20:51:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:51:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:51:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:13,764 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:51:13,764 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 20:51:13,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=154, Invalid=843, Unknown=3, NotChecked=122, Total=1122 [2022-11-02 20:51:13,766 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 135 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:13,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 286 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 501 Invalid, 0 Unknown, 223 Unchecked, 0.4s Time] [2022-11-02 20:51:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 20:51:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2022-11-02 20:51:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 159 states have internal predecessors, (184), 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) [2022-11-02 20:51:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2022-11-02 20:51:13,771 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 27 [2022-11-02 20:51:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:13,771 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2022-11-02 20:51:13,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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) [2022-11-02 20:51:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2022-11-02 20:51:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:51:13,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:13,772 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:13,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:51:13,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-11-02 20:51:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071146114] [2022-11-02 20:51:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:14,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:14,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071146114] [2022-11-02 20:51:14,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071146114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:14,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:14,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377836890] [2022-11-02 20:51:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:14,403 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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) [2022-11-02 20:51:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:14,682 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-11-02 20:51:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 29 [2022-11-02 20:51:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:14,684 INFO L225 Difference]: With dead ends: 174 [2022-11-02 20:51:14,684 INFO L226 Difference]: Without dead ends: 174 [2022-11-02 20:51:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:51:14,684 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:14,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:51:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-02 20:51:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2022-11-02 20:51:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 159 states have internal predecessors, (183), 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) [2022-11-02 20:51:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2022-11-02 20:51:14,691 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 29 [2022-11-02 20:51:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:14,691 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2022-11-02 20:51:14,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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) [2022-11-02 20:51:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2022-11-02 20:51:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:51:14,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:14,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:51:14,693 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-11-02 20:51:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164875232] [2022-11-02 20:51:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164875232] [2022-11-02 20:51:15,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164875232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:15,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820366658] [2022-11-02 20:51:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:15,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:15,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:51:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:51:15,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:15,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:15,695 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:15,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:15,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:15,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:15,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:51:15,758 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-02 20:51:15,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-02 20:51:15,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:15,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 30 [2022-11-02 20:51:16,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:16,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:16,057 INFO L356 Elim1Store]: treesize reduction 10, result has 68.8 percent of original size [2022-11-02 20:51:16,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 41 [2022-11-02 20:51:16,182 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:51:16,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:51:16,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:51:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:16,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:34,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:34,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 465 [2022-11-02 20:51:36,344 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse3 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse4 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse6 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= .cse7 v_prenex_5)))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5))) (let ((.cse9 (select .cse8 v_prenex_6))) (or (not (= (select .cse8 8) .cse9)) (= .cse9 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse10 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse10)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse11 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse11 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse12) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))))) is different from false [2022-11-02 20:51:36,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:36,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2022-11-02 20:51:36,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 97 [2022-11-02 20:51:36,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-11-02 20:51:36,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:36,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:36,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 104 [2022-11-02 20:51:36,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:36,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:51:36,862 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,872 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-02 20:51:36,883 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,893 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,907 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,919 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,929 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2022-11-02 20:51:36,940 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2022-11-02 20:51:36,951 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,962 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-11-02 20:51:36,972 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-02 20:51:36,980 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-11-02 20:51:36,991 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:51:36,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-02 20:51:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820366658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:37,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-11-02 20:51:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562394560] [2022-11-02 20:51:37,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:51:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:51:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1168, Unknown=7, NotChecked=70, Total=1406 [2022-11-02 20:51:37,098 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 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) [2022-11-02 20:51:39,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse3 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (= (select |c_#valid| .cse4) 1) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse5 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse7 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (not (= .cse4 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= .cse8 v_prenex_5)))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse9 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5))) (let ((.cse10 (select .cse9 v_prenex_6))) (or (not (= (select .cse9 8) .cse10)) (= .cse10 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse11 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse11)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse12 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse13) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))))) is different from false [2022-11-02 20:51:41,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse1 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse3 v_prenex_5) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (not (= (select .cse4 8) .cse5)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) .cse0) (= (select |c_#valid| .cse6) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse7 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse8)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse9 v_prenex_5) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5)))) (not (= .cse6 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((v_prenex_5 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= .cse10 v_prenex_5)))))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int)) (or (not (<= v_prenex_6 |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int))) (let ((.cse11 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5))) (let ((.cse12 (select .cse11 v_prenex_6))) (or (not (= (select .cse11 8) .cse12)) (= .cse12 v_prenex_5))))) (not (<= 0 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse13 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse13)))) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse14 v_prenex_5) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (= (select |c_#valid| .cse5) 1) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_5) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)))))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_ArrVal_903 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int) (v_prenex_4 (Array Int Int))) (let ((.cse15 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_prenex_5) v_prenex_6))) (or (= .cse15 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse15) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))))))) is different from false [2022-11-02 20:51:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:41,877 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2022-11-02 20:51:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:51:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:51:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:41,879 INFO L225 Difference]: With dead ends: 168 [2022-11-02 20:51:41,879 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:51:41,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=315, Invalid=1850, Unknown=9, NotChecked=276, Total=2450 [2022-11-02 20:51:41,881 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:41,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 237 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 327 Invalid, 0 Unknown, 298 Unchecked, 0.3s Time] [2022-11-02 20:51:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:51:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2022-11-02 20:51:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.2450331125827814) internal successors, (188), 162 states have internal predecessors, (188), 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) [2022-11-02 20:51:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2022-11-02 20:51:41,890 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 31 [2022-11-02 20:51:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:41,890 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2022-11-02 20:51:41,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 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) [2022-11-02 20:51:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2022-11-02 20:51:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:51:41,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:41,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:41,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:42,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-02 20:51:42,105 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:51:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506278, now seen corresponding path program 1 times [2022-11-02 20:51:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940114595] [2022-11-02 20:51:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940114595] [2022-11-02 20:51:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940114595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432155019] [2022-11-02 20:51:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:42,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:42,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:51:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:51:42,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:42,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:42,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:42,972 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:51:42,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:51:42,991 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:51:42,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:51:43,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:43,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:51:43,097 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:43,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 44 [2022-11-02 20:51:43,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:51:43,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:43,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:51:43,182 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:51:43,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:51:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:43,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:51:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:51:43,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:43,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:51:43,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:43,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:51:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:43,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:55,985 WARN L234 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:51:56,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:56,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 105 [2022-11-02 20:51:56,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (or (not (<= 0 v_prenex_100)) (not (<= v_prenex_100 |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_103) v_prenex_100)))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_36| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_14| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int) (v_ArrVal_1009 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_14|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1008) |v_ULTIMATE.start_main_~list~0#1.offset_36|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_14| v_ArrVal_1007) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1009) |v_ULTIMATE.start_main_~list~0#1.offset_36|))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_36| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_36|)))))) is different from false [2022-11-02 20:51:56,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:56,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:51:56,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2022-11-02 20:51:56,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:56,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:51:56,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:51:56,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:56,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-02 20:51:56,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-11-02 20:51:56,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:56,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-02 20:51:56,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 31 [2022-11-02 20:51:56,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:56,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-11-02 20:51:56,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:56,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:56,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:52:04,633 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:04,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432155019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:04,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:04,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26 [2022-11-02 20:52:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882305737] [2022-11-02 20:52:04,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:04,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:52:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:52:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=568, Unknown=3, NotChecked=48, Total=702 [2022-11-02 20:52:04,839 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 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) [2022-11-02 20:52:06,985 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| .cse0)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((v_prenex_103 Int) (v_prenex_100 Int) (v_prenex_101 (Array Int Int))) (or (not (<= 0 v_prenex_100)) (not (<= v_prenex_100 |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_103) v_prenex_100)))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_36| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_14| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int) (v_ArrVal_1009 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_14|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1008) |v_ULTIMATE.start_main_~list~0#1.offset_36|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_14| v_ArrVal_1007) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1009) |v_ULTIMATE.start_main_~list~0#1.offset_36|))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_36| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_36|)))))) is different from false [2022-11-02 20:52:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:07,781 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-11-02 20:52:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:52:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:52:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:07,783 INFO L225 Difference]: With dead ends: 201 [2022-11-02 20:52:07,783 INFO L226 Difference]: Without dead ends: 201 [2022-11-02 20:52:07,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=174, Invalid=1090, Unknown=4, NotChecked=138, Total=1406 [2022-11-02 20:52:07,784 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 79 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:07,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 364 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 663 Invalid, 0 Unknown, 404 Unchecked, 0.6s Time] [2022-11-02 20:52:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-02 20:52:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 149. [2022-11-02 20:52:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 148 states have internal predecessors, (173), 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) [2022-11-02 20:52:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-11-02 20:52:07,791 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 31 [2022-11-02 20:52:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:07,793 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-11-02 20:52:07,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 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) [2022-11-02 20:52:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-11-02 20:52:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:52:07,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:07,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:07,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:08,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:52:08,005 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-02 20:52:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-11-02 20:52:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:08,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609734450] [2022-11-02 20:52:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609734450] [2022-11-02 20:52:09,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609734450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235929085] [2022-11-02 20:52:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:09,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:09,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:09,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ea6979-b514-4326-9b93-b9b064c61447/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:52:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:09,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 20:52:09,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:09,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:52:09,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:52:09,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:52:09,260 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:52:09,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:52:09,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 20:52:09,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 20:52:09,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:09,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:09,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:09,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2022-11-02 20:52:09,420 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-02 20:52:09,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-02 20:52:09,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:09,539 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:52:09,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2022-11-02 20:52:09,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:09,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:09,561 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:52:09,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 54 [2022-11-02 20:52:10,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:10,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:10,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:10,303 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:52:10,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 40 [2022-11-02 20:52:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:54,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:54,459 INFO L356 Elim1Store]: treesize reduction 22, result has 62.1 percent of original size [2022-11-02 20:52:54,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 722 treesize of output 625 [2022-11-02 20:52:54,646 INFO L356 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-11-02 20:52:54,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62696 treesize of output 14131 [2022-11-02 20:52:55,131 INFO L356 Elim1Store]: treesize reduction 19, result has 51.3 percent of original size [2022-11-02 20:52:55,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5921 treesize of output 5395 [2022-11-02 20:52:55,257 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:52:55,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5349 treesize of output 4919 [2022-11-02 20:52:55,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:55,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:55,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:55,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:55,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 4270 treesize of output 3834 [2022-11-02 20:52:55,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4