./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:01:27,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:01:27,976 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 05:01:27,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:01:27,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:01:28,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:01:28,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:01:28,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:01:28,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:01:28,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:01:28,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:01:28,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:01:28,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:01:28,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:01:28,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:01:28,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:01:28,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:01:28,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:01:28,018 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:01:28,018 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:01:28,018 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:01:28,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:01:28,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:01:28,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:01:28,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:01:28,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:01:28,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:01:28,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:01:28,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:01:28,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:01:28,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:28,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:01:28,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:28,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:01:28,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:01:28,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:01:28,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:01:28,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:01:28,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:01:28,023 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2024-11-28 05:01:28,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:01:28,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:01:28,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:01:28,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:01:28,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:01:28,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-28 05:01:31,305 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/data/8d9c32ddd/33f54f21eb8b4e2e9e8a9773913849d7/FLAGc9ad45f3b [2024-11-28 05:01:31,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:01:31,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-28 05:01:31,714 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/data/8d9c32ddd/33f54f21eb8b4e2e9e8a9773913849d7/FLAGc9ad45f3b [2024-11-28 05:01:31,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/data/8d9c32ddd/33f54f21eb8b4e2e9e8a9773913849d7 [2024-11-28 05:01:31,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:01:31,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:01:31,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:01:31,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:01:31,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:01:31,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:31" (1/1) ... [2024-11-28 05:01:31,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692d0520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:31, skipping insertion in model container [2024-11-28 05:01:31,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:01:31" (1/1) ... [2024-11-28 05:01:31,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:01:32,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:01:32,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:01:32,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:01:32,227 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:01:32,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32 WrapperNode [2024-11-28 05:01:32,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:01:32,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:01:32,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:01:32,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:01:32,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,266 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2024-11-28 05:01:32,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:01:32,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:01:32,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:01:32,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:01:32,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,319 INFO L175 MemorySlicer]: Split 22 memory accesses to 1 slices as follows [22]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-28 05:01:32,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:01:32,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:01:32,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:01:32,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:01:32,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (1/1) ... [2024-11-28 05:01:32,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:01:32,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:32,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:01:32,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:01:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2024-11-28 05:01:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2024-11-28 05:01:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-28 05:01:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-28 05:01:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-11-28 05:01:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-11-28 05:01:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-28 05:01:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-28 05:01:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2024-11-28 05:01:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2024-11-28 05:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:01:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:01:32,552 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:01:32,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:01:32,969 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-28 05:01:32,969 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:01:32,982 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:01:32,983 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 05:01:32,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:32 BoogieIcfgContainer [2024-11-28 05:01:32,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:01:32,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:01:32,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:01:32,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:01:32,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:01:31" (1/3) ... [2024-11-28 05:01:32,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1924f5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:32, skipping insertion in model container [2024-11-28 05:01:32,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:01:32" (2/3) ... [2024-11-28 05:01:32,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1924f5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:01:32, skipping insertion in model container [2024-11-28 05:01:32,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:01:32" (3/3) ... [2024-11-28 05:01:32,995 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2024-11-28 05:01:33,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:01:33,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-twice.i that has 6 procedures, 143 locations, 1 initial locations, 6 loop locations, and 51 error locations. [2024-11-28 05:01:33,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:01:33,081 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d879cf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:01:33,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-28 05:01:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:01:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 05:01:33,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:33,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 05:01:33,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:33,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 57486637, now seen corresponding path program 1 times [2024-11-28 05:01:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802092452] [2024-11-28 05:01:33,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802092452] [2024-11-28 05:01:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802092452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:01:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952740951] [2024-11-28 05:01:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:01:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:33,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:01:33,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:33,444 INFO L87 Difference]: Start difference. First operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:33,645 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2024-11-28 05:01:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:01:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 05:01:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:33,657 INFO L225 Difference]: With dead ends: 140 [2024-11-28 05:01:33,657 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 05:01:33,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:33,664 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:33,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:01:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 05:01:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-28 05:01:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.726027397260274) internal successors, (126), 120 states have internal predecessors, (126), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:01:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-28 05:01:33,721 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 5 [2024-11-28 05:01:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:33,721 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-28 05:01:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-28 05:01:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 05:01:33,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:33,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 05:01:33,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:01:33,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:33,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash 57486638, now seen corresponding path program 1 times [2024-11-28 05:01:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128728516] [2024-11-28 05:01:33,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128728516] [2024-11-28 05:01:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128728516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:01:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893939542] [2024-11-28 05:01:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:01:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:33,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:01:33,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:33,880 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:34,024 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2024-11-28 05:01:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:01:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 05:01:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:34,026 INFO L225 Difference]: With dead ends: 135 [2024-11-28 05:01:34,026 INFO L226 Difference]: Without dead ends: 135 [2024-11-28 05:01:34,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:34,027 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:34,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:01:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-28 05:01:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-28 05:01:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 117 states have internal predecessors, (123), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:01:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-28 05:01:34,048 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 5 [2024-11-28 05:01:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:34,048 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-28 05:01:34,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-28 05:01:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 05:01:34,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:34,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:34,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:01:34,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:34,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966071, now seen corresponding path program 1 times [2024-11-28 05:01:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946829221] [2024-11-28 05:01:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946829221] [2024-11-28 05:01:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946829221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:34,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:01:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921731882] [2024-11-28 05:01:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:34,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:01:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:34,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:01:34,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:34,228 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:01:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:34,352 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-28 05:01:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:01:34,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-28 05:01:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:34,354 INFO L225 Difference]: With dead ends: 134 [2024-11-28 05:01:34,354 INFO L226 Difference]: Without dead ends: 134 [2024-11-28 05:01:34,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:34,355 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:34,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 238 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:01:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-28 05:01:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-28 05:01:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 116 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:01:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-28 05:01:34,364 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2024-11-28 05:01:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:34,366 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-28 05:01:34,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:01:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-28 05:01:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 05:01:34,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:34,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:34,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:01:34,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966072, now seen corresponding path program 1 times [2024-11-28 05:01:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351681530] [2024-11-28 05:01:34,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:34,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351681530] [2024-11-28 05:01:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351681530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:01:34,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569070284] [2024-11-28 05:01:34,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:01:34,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:34,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:01:34,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:34,568 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:01:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:34,667 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2024-11-28 05:01:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:01:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-28 05:01:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:34,669 INFO L225 Difference]: With dead ends: 133 [2024-11-28 05:01:34,669 INFO L226 Difference]: Without dead ends: 133 [2024-11-28 05:01:34,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:01:34,670 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:34,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:01:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-28 05:01:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-28 05:01:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:01:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2024-11-28 05:01:34,692 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2024-11-28 05:01:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:34,692 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2024-11-28 05:01:34,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:01:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2024-11-28 05:01:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:01:34,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:34,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:34,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:01:34,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:34,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -641822357, now seen corresponding path program 1 times [2024-11-28 05:01:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:34,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792993383] [2024-11-28 05:01:34,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:35,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792993383] [2024-11-28 05:01:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792993383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:01:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940767714] [2024-11-28 05:01:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:01:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:35,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:01:35,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:01:35,210 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:01:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:35,879 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2024-11-28 05:01:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:01:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-28 05:01:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:35,884 INFO L225 Difference]: With dead ends: 169 [2024-11-28 05:01:35,885 INFO L226 Difference]: Without dead ends: 169 [2024-11-28 05:01:35,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:01:35,886 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 67 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:35,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 473 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:01:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-28 05:01:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2024-11-28 05:01:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 126 states have internal predecessors, (146), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-28 05:01:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2024-11-28 05:01:35,912 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 25 [2024-11-28 05:01:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:35,912 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2024-11-28 05:01:35,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:01:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2024-11-28 05:01:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:01:35,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:35,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:01:35,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -641822356, now seen corresponding path program 1 times [2024-11-28 05:01:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619067505] [2024-11-28 05:01:35,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619067505] [2024-11-28 05:01:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619067505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:01:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847034366] [2024-11-28 05:01:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:01:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:01:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:01:36,569 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:01:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:37,371 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-11-28 05:01:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:01:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-28 05:01:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:37,373 INFO L225 Difference]: With dead ends: 187 [2024-11-28 05:01:37,373 INFO L226 Difference]: Without dead ends: 187 [2024-11-28 05:01:37,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:01:37,375 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:37,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 448 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:01:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-28 05:01:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2024-11-28 05:01:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.607843137254902) internal successors, (164), 140 states have internal predecessors, (164), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-28 05:01:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-28 05:01:37,402 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 25 [2024-11-28 05:01:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-28 05:01:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:01:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-28 05:01:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:01:37,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:37,403 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:01:37,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 186988631, now seen corresponding path program 1 times [2024-11-28 05:01:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336341433] [2024-11-28 05:01:37,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336341433] [2024-11-28 05:01:37,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336341433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111687284] [2024-11-28 05:01:37,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:37,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:37,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:37,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:01:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 05:01:37,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:37,953 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:01:38,000 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:38,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 05:01:38,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111687284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:01:38,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:01:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-28 05:01:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896407805] [2024-11-28 05:01:38,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:01:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:38,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:01:38,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-28 05:01:38,235 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:01:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:38,888 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2024-11-28 05:01:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:01:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2024-11-28 05:01:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:38,890 INFO L225 Difference]: With dead ends: 181 [2024-11-28 05:01:38,890 INFO L226 Difference]: Without dead ends: 181 [2024-11-28 05:01:38,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2024-11-28 05:01:38,891 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 125 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:38,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 583 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 505 Invalid, 0 Unknown, 167 Unchecked, 0.5s Time] [2024-11-28 05:01:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-28 05:01:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2024-11-28 05:01:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 140 states have internal predecessors, (165), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-28 05:01:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-11-28 05:01:38,912 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 28 [2024-11-28 05:01:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-11-28 05:01:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:01:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-11-28 05:01:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:01:38,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:38,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:38,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:01:39,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:39,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 186988632, now seen corresponding path program 1 times [2024-11-28 05:01:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846028058] [2024-11-28 05:01:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:39,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846028058] [2024-11-28 05:01:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846028058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204469957] [2024-11-28 05:01:39,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:39,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:39,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:39,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:39,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:01:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:39,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 05:01:39,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:39,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:39,650 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-28 05:01:39,689 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:39,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 05:01:39,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204469957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:39,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2024-11-28 05:01:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897428201] [2024-11-28 05:01:39,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:39,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:01:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:39,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:01:39,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-28 05:01:39,792 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:40,336 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2024-11-28 05:01:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:01:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-11-28 05:01:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:40,338 INFO L225 Difference]: With dead ends: 170 [2024-11-28 05:01:40,338 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 05:01:40,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2024-11-28 05:01:40,339 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 33 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:40,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 569 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 501 Invalid, 0 Unknown, 153 Unchecked, 0.4s Time] [2024-11-28 05:01:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 05:01:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 05:01:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 142 states have internal predecessors, (166), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-28 05:01:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2024-11-28 05:01:40,349 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 28 [2024-11-28 05:01:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:40,349 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2024-11-28 05:01:40,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2024-11-28 05:01:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:01:40,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:40,351 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:40,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 05:01:40,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:40,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 461928915, now seen corresponding path program 1 times [2024-11-28 05:01:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183251047] [2024-11-28 05:01:40,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:01:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183251047] [2024-11-28 05:01:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183251047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386088363] [2024-11-28 05:01:41,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:41,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:41,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:41,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:01:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:41,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 05:01:41,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:41,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:41,557 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:01:41,589 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-28 05:01:41,591 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-28 05:01:41,619 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-28 05:01:41,622 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-28 05:01:41,770 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:41,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:41,793 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-11-28 05:01:41,796 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-11-28 05:01:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-28 05:01:41,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:42,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386088363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:42,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2024-11-28 05:01:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234751418] [2024-11-28 05:01:42,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:42,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:01:42,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:42,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:01:42,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2024-11-28 05:01:42,129 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 05:01:42,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from false [2024-11-28 05:01:42,478 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from true [2024-11-28 05:01:42,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-28 05:01:42,491 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-28 05:01:42,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2024-11-28 05:01:42,500 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2024-11-28 05:01:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:43,180 INFO L93 Difference]: Finished difference Result 199 states and 248 transitions. [2024-11-28 05:01:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:01:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-28 05:01:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:43,182 INFO L225 Difference]: With dead ends: 199 [2024-11-28 05:01:43,182 INFO L226 Difference]: Without dead ends: 199 [2024-11-28 05:01:43,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2024-11-28 05:01:43,183 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 61 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1053 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:43,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 750 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 847 Invalid, 0 Unknown, 1053 Unchecked, 0.8s Time] [2024-11-28 05:01:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-28 05:01:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 177. [2024-11-28 05:01:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 148 states have internal predecessors, (174), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-28 05:01:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2024-11-28 05:01:43,196 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 37 [2024-11-28 05:01:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2024-11-28 05:01:43,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 05:01:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2024-11-28 05:01:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:01:43,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:43,198 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:43,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:01:43,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 05:01:43,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:43,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 461928916, now seen corresponding path program 1 times [2024-11-28 05:01:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154895799] [2024-11-28 05:01:43,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:01:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154895799] [2024-11-28 05:01:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154895799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147570403] [2024-11-28 05:01:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:44,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:44,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:01:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:44,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 05:01:44,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:44,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:44,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:01:44,613 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-28 05:01:44,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:01:44,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:01:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-28 05:01:44,838 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 05:01:44,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 05:01:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 05:01:44,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147570403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:45,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-28 05:01:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072820382] [2024-11-28 05:01:45,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:01:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:45,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:01:45,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=510, Unknown=1, NotChecked=46, Total=650 [2024-11-28 05:01:45,185 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 05:01:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:46,518 INFO L93 Difference]: Finished difference Result 226 states and 289 transitions. [2024-11-28 05:01:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:01:46,519 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2024-11-28 05:01:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:46,521 INFO L225 Difference]: With dead ends: 226 [2024-11-28 05:01:46,521 INFO L226 Difference]: Without dead ends: 226 [2024-11-28 05:01:46,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-28 05:01:46,525 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 161 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:46,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 631 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1301 Invalid, 0 Unknown, 231 Unchecked, 1.2s Time] [2024-11-28 05:01:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-28 05:01:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2024-11-28 05:01:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.5897435897435896) internal successors, (186), 152 states have internal predecessors, (186), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-28 05:01:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2024-11-28 05:01:46,543 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 37 [2024-11-28 05:01:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:46,544 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2024-11-28 05:01:46,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 05:01:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2024-11-28 05:01:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 05:01:46,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:46,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:46,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:01:46,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:46,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -228485393, now seen corresponding path program 1 times [2024-11-28 05:01:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816238392] [2024-11-28 05:01:46,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:01:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816238392] [2024-11-28 05:01:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816238392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172303789] [2024-11-28 05:01:47,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:47,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:47,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:47,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:01:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:47,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 05:01:47,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:47,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:47,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:01:47,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 05:01:47,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:01:47,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:47,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 05:01:47,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:01:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172303789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:01:47,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:01:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2024-11-28 05:01:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625494306] [2024-11-28 05:01:47,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:01:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:01:47,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-28 05:01:47,475 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:01:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:48,218 INFO L93 Difference]: Finished difference Result 195 states and 250 transitions. [2024-11-28 05:01:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:01:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-11-28 05:01:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:48,220 INFO L225 Difference]: With dead ends: 195 [2024-11-28 05:01:48,220 INFO L226 Difference]: Without dead ends: 195 [2024-11-28 05:01:48,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2024-11-28 05:01:48,221 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 69 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:48,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 760 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 660 Invalid, 0 Unknown, 165 Unchecked, 0.6s Time] [2024-11-28 05:01:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-28 05:01:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2024-11-28 05:01:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 151 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-28 05:01:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2024-11-28 05:01:48,230 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 40 [2024-11-28 05:01:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:48,231 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2024-11-28 05:01:48,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:01:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2024-11-28 05:01:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 05:01:48,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:48,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:48,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:01:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:48,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -228485392, now seen corresponding path program 1 times [2024-11-28 05:01:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144836649] [2024-11-28 05:01:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:01:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144836649] [2024-11-28 05:01:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144836649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803885386] [2024-11-28 05:01:48,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:48,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:48,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:48,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:01:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:49,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 05:01:49,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:49,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:49,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:01:49,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:01:49,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 05:01:49,245 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-28 05:01:49,267 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:49,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 05:01:49,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803885386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:49,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-28 05:01:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89405163] [2024-11-28 05:01:49,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:49,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:01:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:49,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:01:49,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2024-11-28 05:01:49,386 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:01:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:50,418 INFO L93 Difference]: Finished difference Result 193 states and 248 transitions. [2024-11-28 05:01:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:01:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-28 05:01:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:50,420 INFO L225 Difference]: With dead ends: 193 [2024-11-28 05:01:50,420 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 05:01:50,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2024-11-28 05:01:50,421 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:50,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 965 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1199 Invalid, 0 Unknown, 165 Unchecked, 0.9s Time] [2024-11-28 05:01:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 05:01:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2024-11-28 05:01:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 117 states have (on average 1.564102564102564) internal successors, (183), 149 states have internal predecessors, (183), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-28 05:01:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2024-11-28 05:01:50,430 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 40 [2024-11-28 05:01:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:50,430 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2024-11-28 05:01:50,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:01:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2024-11-28 05:01:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 05:01:50,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:50,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:50,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:01:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:50,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2086065682, now seen corresponding path program 1 times [2024-11-28 05:01:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007242163] [2024-11-28 05:01:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:01:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007242163] [2024-11-28 05:01:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007242163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958894737] [2024-11-28 05:01:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:51,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:51,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:01:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:51,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 05:01:51,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:51,342 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:01:51,366 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-28 05:01:51,369 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-28 05:01:51,390 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-28 05:01:51,393 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-28 05:01:51,559 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:01:51,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 05:01:51,580 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-11-28 05:01:51,583 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-11-28 05:01:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-28 05:01:51,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958894737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:51,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2024-11-28 05:01:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692233457] [2024-11-28 05:01:51,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:51,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:01:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:51,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:01:51,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=150, Unknown=7, NotChecked=116, Total=342 [2024-11-28 05:01:51,840 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 05:01:52,043 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-28 05:01:52,048 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-28 05:01:52,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse4) 1) (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from false [2024-11-28 05:01:52,060 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse4) 1) (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from true [2024-11-28 05:01:52,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2024-11-28 05:01:52,070 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2024-11-28 05:01:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:52,688 INFO L93 Difference]: Finished difference Result 210 states and 266 transitions. [2024-11-28 05:01:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:01:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2024-11-28 05:01:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:52,691 INFO L225 Difference]: With dead ends: 210 [2024-11-28 05:01:52,691 INFO L226 Difference]: Without dead ends: 210 [2024-11-28 05:01:52,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=217, Unknown=13, NotChecked=266, Total=600 [2024-11-28 05:01:52,692 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:52,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 607 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 567 Invalid, 0 Unknown, 962 Unchecked, 0.7s Time] [2024-11-28 05:01:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-28 05:01:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 179. [2024-11-28 05:01:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 116 states have (on average 1.5603448275862069) internal successors, (181), 149 states have internal predecessors, (181), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-28 05:01:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2024-11-28 05:01:52,705 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 52 [2024-11-28 05:01:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2024-11-28 05:01:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 05:01:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2024-11-28 05:01:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:01:52,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:52,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:52,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:01:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:52,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1654332115, now seen corresponding path program 1 times [2024-11-28 05:01:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937753561] [2024-11-28 05:01:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 05:01:53,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937753561] [2024-11-28 05:01:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937753561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:53,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:53,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:01:53,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755452543] [2024-11-28 05:01:53,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:53,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:01:53,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:53,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:01:53,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:01:53,004 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:53,221 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2024-11-28 05:01:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:01:53,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-28 05:01:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:53,223 INFO L225 Difference]: With dead ends: 207 [2024-11-28 05:01:53,223 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 05:01:53,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:01:53,224 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 28 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:01:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 05:01:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2024-11-28 05:01:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 137 states have (on average 1.5912408759124088) internal successors, (218), 166 states have internal predecessors, (218), 20 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (38), 28 states have call predecessors, (38), 20 states have call successors, (38) [2024-11-28 05:01:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 276 transitions. [2024-11-28 05:01:53,233 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 276 transitions. Word has length 47 [2024-11-28 05:01:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:53,234 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 276 transitions. [2024-11-28 05:01:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 276 transitions. [2024-11-28 05:01:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:01:53,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:53,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:53,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:01:53,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1654332116, now seen corresponding path program 1 times [2024-11-28 05:01:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489984395] [2024-11-28 05:01:53,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 05:01:53,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489984395] [2024-11-28 05:01:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489984395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:53,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:01:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970418407] [2024-11-28 05:01:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:01:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:01:53,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:01:53,459 INFO L87 Difference]: Start difference. First operand 200 states and 276 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:53,748 INFO L93 Difference]: Finished difference Result 214 states and 289 transitions. [2024-11-28 05:01:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:01:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-28 05:01:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:53,750 INFO L225 Difference]: With dead ends: 214 [2024-11-28 05:01:53,750 INFO L226 Difference]: Without dead ends: 214 [2024-11-28 05:01:53,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:01:53,750 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 22 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:53,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 779 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:01:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-28 05:01:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2024-11-28 05:01:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.5655172413793104) internal successors, (227), 174 states have internal predecessors, (227), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-28 05:01:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 289 transitions. [2024-11-28 05:01:53,764 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 289 transitions. Word has length 47 [2024-11-28 05:01:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:53,764 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 289 transitions. [2024-11-28 05:01:53,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 289 transitions. [2024-11-28 05:01:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:01:53,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:53,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:53,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:01:53,765 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash 675341734, now seen corresponding path program 1 times [2024-11-28 05:01:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522935180] [2024-11-28 05:01:53,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 05:01:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:53,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522935180] [2024-11-28 05:01:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522935180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:53,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:01:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293302971] [2024-11-28 05:01:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:01:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:53,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:01:53,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:01:53,918 INFO L87 Difference]: Start difference. First operand 210 states and 289 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:54,007 INFO L93 Difference]: Finished difference Result 218 states and 301 transitions. [2024-11-28 05:01:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:01:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-28 05:01:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:54,010 INFO L225 Difference]: With dead ends: 218 [2024-11-28 05:01:54,010 INFO L226 Difference]: Without dead ends: 218 [2024-11-28 05:01:54,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:01:54,011 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 31 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:54,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 839 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:01:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-28 05:01:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2024-11-28 05:01:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 146 states have (on average 1.547945205479452) internal successors, (226), 175 states have internal predecessors, (226), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-28 05:01:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2024-11-28 05:01:54,021 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 49 [2024-11-28 05:01:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2024-11-28 05:01:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:01:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2024-11-28 05:01:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:01:54,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:54,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:54,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:01:54,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:01:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 393247613, now seen corresponding path program 1 times [2024-11-28 05:01:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397415011] [2024-11-28 05:01:54,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397415011] [2024-11-28 05:01:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397415011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150280213] [2024-11-28 05:01:55,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:55,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:55,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:01:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:55,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 05:01:55,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:55,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:01:55,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:01:55,439 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-28 05:01:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:01:55,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:01:55,544 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-28 05:01:55,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2024-11-28 05:01:55,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 05:01:55,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 05:01:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 05:01:55,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:02:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150280213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:02:00,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:02:00,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 31 [2024-11-28 05:02:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379902615] [2024-11-28 05:02:00,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:02:00,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:02:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:00,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:02:00,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2024-11-28 05:02:00,093 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 32 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-28 05:02:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:02,696 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2024-11-28 05:02:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:02:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2024-11-28 05:02:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:02,698 INFO L225 Difference]: With dead ends: 259 [2024-11-28 05:02:02,698 INFO L226 Difference]: Without dead ends: 259 [2024-11-28 05:02:02,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=183, Invalid=2269, Unknown=2, NotChecked=96, Total=2550 [2024-11-28 05:02:02,700 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 83 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:02,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1561 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2435 Invalid, 0 Unknown, 218 Unchecked, 1.7s Time] [2024-11-28 05:02:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-28 05:02:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2024-11-28 05:02:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 193 states have internal predecessors, (253), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 32 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-28 05:02:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2024-11-28 05:02:02,711 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 51 [2024-11-28 05:02:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:02,711 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2024-11-28 05:02:02,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-28 05:02:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2024-11-28 05:02:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:02:02,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:02,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:02,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:02:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:02:02,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:02:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash 393247614, now seen corresponding path program 1 times [2024-11-28 05:02:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408738076] [2024-11-28 05:02:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408738076] [2024-11-28 05:02:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408738076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:02:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872420669] [2024-11-28 05:02:04,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:04,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:02:04,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:02:04,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:02:04,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:02:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:04,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-28 05:02:04,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:02:04,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:02:04,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:02:04,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:02:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:02:17,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:02:17,859 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-28 05:02:17,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-28 05:02:17,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:02:17,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 05:02:17,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:02:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:02:18,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 05:02:18,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 05:02:19,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 05:02:19,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 05:02:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:19,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:02:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872420669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:02:22,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:02:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 41 [2024-11-28 05:02:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354085313] [2024-11-28 05:02:22,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:02:22,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-28 05:02:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:22,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-28 05:02:22,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2299, Unknown=3, NotChecked=0, Total=2450 [2024-11-28 05:02:22,183 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 32 states have internal predecessors, (77), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-28 05:02:31,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:02:35,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:02:41,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:02:45,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:02:51,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:02:56,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:03:02,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:03:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:02,648 INFO L93 Difference]: Finished difference Result 262 states and 347 transitions. [2024-11-28 05:03:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:03:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 32 states have internal predecessors, (77), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) Word has length 51 [2024-11-28 05:03:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:02,650 INFO L225 Difference]: With dead ends: 262 [2024-11-28 05:03:02,650 INFO L226 Difference]: Without dead ends: 262 [2024-11-28 05:03:02,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=289, Invalid=4263, Unknown=4, NotChecked=0, Total=4556 [2024-11-28 05:03:02,653 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 155 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 58 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:02,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1992 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3157 Invalid, 7 Unknown, 0 Unchecked, 37.7s Time] [2024-11-28 05:03:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-28 05:03:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2024-11-28 05:03:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 193 states have internal predecessors, (252), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 32 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-28 05:03:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2024-11-28 05:03:02,669 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 51 [2024-11-28 05:03:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2024-11-28 05:03:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 32 states have internal predecessors, (77), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-28 05:03:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2024-11-28 05:03:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:03:02,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:02,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:03:02,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 05:03:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:03:02,872 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:03:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1695480261, now seen corresponding path program 2 times [2024-11-28 05:03:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758175018] [2024-11-28 05:03:02,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:02,894 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:02,894 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:03:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758175018] [2024-11-28 05:03:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758175018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114966393] [2024-11-28 05:03:05,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:03:05,982 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:03:05,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:03:06,136 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:06,136 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:06,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 05:03:06,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:03:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:03:06,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse0 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from false [2024-11-28 05:03:06,902 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse0 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from true [2024-11-28 05:03:06,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:03:07,026 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and .cse0 (= .cse1 .cse2)) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= c_create_internal_~now~0.base .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse2) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from false [2024-11-28 05:03:07,034 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (= |c_#valid| (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (.cse2 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and .cse0 (= .cse1 .cse2)) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= c_create_internal_~now~0.base .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse2) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from true [2024-11-28 05:03:07,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2024-11-28 05:03:07,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse2 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33)))) (.cse3 (= |c_#valid| (store |c_old(#valid)| .cse4 .cse5)))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse0 |c_create_internal_#t~mem8.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))))) (and .cse2 .cse3 (= |c_create_internal_#t~mem8.base| .cse4)) (and (or (= .cse5 1) (and (= |c_#valid| |c_old(#valid)|) .cse2)) .cse3))))) is different from false [2024-11-28 05:03:07,371 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse2 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33)))) (.cse3 (= |c_#valid| (store |c_old(#valid)| .cse4 .cse5)))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse0 |c_create_internal_#t~mem8.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))))) (and .cse2 .cse3 (= |c_create_internal_#t~mem8.base| .cse4)) (and (or (= .cse5 1) (and (= |c_#valid| |c_old(#valid)|) .cse2)) .cse3))))) is different from true [2024-11-28 05:03:07,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse2 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33)))) (.cse3 (= |c_#valid| (store |c_old(#valid)| .cse4 .cse5)))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= .cse0 c_create_internal_~now~0.base)))) (and .cse2 .cse3 (= c_create_internal_~now~0.base .cse4)) (and (or (= .cse5 1) (and (= |c_#valid| |c_old(#valid)|) .cse2)) .cse3))))) is different from false [2024-11-28 05:03:07,508 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse2 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33)))) (.cse3 (= |c_#valid| (store |c_old(#valid)| .cse4 .cse5)))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |c_#valid| .cse0))) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= .cse0 c_create_internal_~now~0.base)))) (and .cse2 .cse3 (= c_create_internal_~now~0.base .cse4)) (and (or (= .cse5 1) (and (= |c_#valid| |c_old(#valid)|) .cse2)) .cse3))))) is different from true [2024-11-28 05:03:07,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:03:07,927 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse0) 1) (= .cse1 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_43| .cse0))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_old(#valid)_AFTER_CALL_44| .cse1)) |v_old(#valid)_AFTER_CALL_44|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|) (= .cse2 c_create_internal_~now~0.base) (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-28 05:03:07,935 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse0) 1) (= .cse1 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_43| .cse0))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_old(#valid)_AFTER_CALL_44| .cse1)) |v_old(#valid)_AFTER_CALL_44|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|) (= .cse2 c_create_internal_~now~0.base) (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-28 05:03:08,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) .cse0) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3)) |v_old(#valid)_AFTER_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))))) is different from false [2024-11-28 05:03:08,087 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) .cse0) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3)) |v_old(#valid)_AFTER_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))))) is different from true [2024-11-28 05:03:09,186 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-28 05:03:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2024-11-28 05:03:09,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_43|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_45| .cse0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) |v_old(#valid)_AFTER_CALL_43|) (= (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_old(#valid)_AFTER_CALL_44| .cse1)) |v_old(#valid)_AFTER_CALL_44|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|) 1)))) .cse2))) is different from false [2024-11-28 05:03:09,258 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_43|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_45| .cse0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) |v_old(#valid)_AFTER_CALL_43|) (= (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_old(#valid)_AFTER_CALL_44| .cse1)) |v_old(#valid)_AFTER_CALL_44|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse2 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|) 1)))) .cse2))) is different from true [2024-11-28 05:03:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2024-11-28 05:03:09,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:03:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114966393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:10,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:03:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2024-11-28 05:03:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313427717] [2024-11-28 05:03:10,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:03:10,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 05:03:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:10,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 05:03:10,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=490, Unknown=15, NotChecked=424, Total=1056 [2024-11-28 05:03:10,426 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 05:03:11,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse8))) (let ((.cse5 (@diff .cse17 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse5))) (let ((.cse16 (store .cse17 .cse5 .cse9))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse10 (select |c_#valid| .cse11)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse12 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse15 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 .cse4 .cse1) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or .cse0 .cse1 (= .cse8 1)) (or (= .cse9 1) .cse6 .cse7) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse14 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse13 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse14) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse13 (select |c_#valid| .cse13))) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse14 (select |v_old(#valid)_AFTER_CALL_43| .cse14)))))) (and (or .cse0 .cse15) .cse7) (and .cse4 .cse7)) (= |c_#valid| (store .cse16 .cse11 .cse10)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse3) .cse6 .cse7) .cse12 (or .cse0 .cse1 .cse15)))))))))) is different from false [2024-11-28 05:03:11,756 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse8))) (let ((.cse5 (@diff .cse17 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse5))) (let ((.cse16 (store .cse17 .cse5 .cse9))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (= .cse2 |c_create_internal_#t~ret7.base|)) (.cse10 (select |c_#valid| .cse11)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse12 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse15 (= c_create_internal_~now~0.base .cse2))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 .cse4 .cse1) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or .cse0 .cse1 (= .cse8 1)) (or (= .cse9 1) .cse6 .cse7) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse14 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse13 |c_create_internal_#t~ret7.base|) (= c_create_internal_~now~0.base .cse14) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse13 (select |c_#valid| .cse13))) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse14 (select |v_old(#valid)_AFTER_CALL_43| .cse14)))))) (and (or .cse0 .cse15) .cse7) (and .cse4 .cse7)) (= |c_#valid| (store .cse16 .cse11 .cse10)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse3) .cse6 .cse7) .cse12 (or .cse0 .cse1 .cse15)))))))))) is different from true [2024-11-28 05:03:11,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse13))) (let ((.cse16 (store |c_old(#valid)| .cse13 .cse3))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse11))) (let ((.cse10 (store .cse16 .cse11 .cse4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse13) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse5 (= (select |c_old(#valid)| .cse11) 0)) (.cse2 (= .cse13 .cse12)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= |c_#valid| .cse16)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (= .cse11 .cse12) .cse5 .cse6) (or (and .cse6 .cse2) (and (or .cse0 (= c_create_internal_~now~0.base .cse13)) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse14 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= c_create_internal_~now~0.base .cse14) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse15 (select |c_#valid| .cse15))) (= .cse15 .cse12) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse14 (select |v_old(#valid)_AFTER_CALL_43| .cse14))))))) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from false [2024-11-28 05:03:11,778 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse13))) (let ((.cse16 (store |c_old(#valid)| .cse13 .cse3))) (let ((.cse11 (@diff .cse16 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse11))) (let ((.cse10 (store .cse16 .cse11 .cse4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (@diff .cse10 |c_#valid|))) (let ((.cse1 (= (select |c_old(#valid)| .cse13) 0)) (.cse7 (select |c_#valid| .cse8)) (.cse5 (= (select |c_old(#valid)| .cse11) 0)) (.cse2 (= .cse13 .cse12)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= |c_#valid| .cse16)) (.cse9 (= |c_#valid| .cse10))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (= |c_#valid| (store .cse10 .cse8 .cse7)) (or (= .cse11 .cse12) .cse5 .cse6) (or (and .cse6 .cse2) (and (or .cse0 (= c_create_internal_~now~0.base .cse13)) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse14 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= c_create_internal_~now~0.base .cse14) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse15 (select |c_#valid| .cse15))) (= .cse15 .cse12) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse14 (select |v_old(#valid)_AFTER_CALL_43| .cse14))))))) .cse9 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from true [2024-11-28 05:03:11,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse16 (select |c_#valid| .cse17))) (let ((.cse15 (store |c_old(#valid)| .cse17 .cse16))) (let ((.cse3 (@diff .cse15 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse3))) (let ((.cse14 (store .cse15 .cse3 .cse10))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse2 (= |c_create_internal_#t~mem8.base| .cse17)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse17) 0)) (.cse9 (= .cse16 1)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse11 (select |c_#valid| .cse12)) (.cse13 (= |c_#valid| .cse14))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (let ((.cse8 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse7 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse6 |c_create_internal_#t~mem8.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |c_#valid| .cse6))) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse7 (select |v_old(#valid)_AFTER_CALL_43| .cse7)))))) (and .cse8 .cse5 .cse2) (and (or .cse9 (and .cse0 .cse8)) .cse5))) (or .cse0 .cse1 .cse9) (or (= .cse10 1) .cse4 .cse5) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) .cse13))))))))) is different from false [2024-11-28 05:03:11,800 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse16 (select |c_#valid| .cse17))) (let ((.cse15 (store |c_old(#valid)| .cse17 .cse16))) (let ((.cse3 (@diff .cse15 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse3))) (let ((.cse14 (store .cse15 .cse3 .cse10))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse2 (= |c_create_internal_#t~mem8.base| .cse17)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse17) 0)) (.cse9 (= .cse16 1)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse15)) (.cse11 (select |c_#valid| .cse12)) (.cse13 (= |c_#valid| .cse14))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (let ((.cse8 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|)) (.cse7 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|))) (and (= .cse6 |c_create_internal_#t~mem8.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |c_#valid| .cse6))) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse7 (select |v_old(#valid)_AFTER_CALL_43| .cse7)))))) (and .cse8 .cse5 .cse2) (and (or .cse9 (and .cse0 .cse8)) .cse5))) (or .cse0 .cse1 .cse9) (or (= .cse10 1) .cse4 .cse5) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) .cse13))))))))) is different from true [2024-11-28 05:03:11,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse8 (= |c_#valid| .cse9)) (.cse2 (= .cse17 1)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0)) (.cse14 (= c_create_internal_~now~0.base .cse15))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (let ((.cse13 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse11 (select |c_#valid| .cse11))) (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_43| .cse12))) (= .cse11 c_create_internal_~now~0.base)))) (and .cse13 .cse5 .cse14) (and (or .cse2 (and .cse0 .cse13)) .cse5))) (or .cse0 .cse1 .cse14)))))))))) is different from false [2024-11-28 05:03:11,824 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse8 (= |c_#valid| .cse9)) (.cse2 (= .cse17 1)) (.cse5 (= |c_#valid| .cse16)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0)) (.cse14 (= c_create_internal_~now~0.base .cse15))) (and (or .cse0 .cse1 .cse2) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (let ((.cse13 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse11 (select |c_#valid| .cse11))) (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_43| .cse12))) (= .cse11 c_create_internal_~now~0.base)))) (and .cse13 .cse5 .cse14) (and (or .cse2 (and .cse0 .cse13)) .cse5))) (or .cse0 .cse1 .cse14)))))))))) is different from true [2024-11-28 05:03:11,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse9))) (let ((.cse2 (store |c_old(#valid)| .cse9 .cse7))) (let ((.cse0 (@diff .cse2 |c_#valid|)) (.cse1 (= |c_#valid| .cse2)) (.cse8 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= c_create_internal_~now~0.base .cse9))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (= |c_#valid| (store .cse2 .cse0 (select |c_#valid| .cse0))) (let ((.cse5 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |c_#valid| .cse3))) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_43| .cse4))) (= .cse3 c_create_internal_~now~0.base)))) (and .cse5 .cse1 .cse6) (and (or (= .cse7 1) (and .cse8 .cse5)) .cse1))) (or .cse8 (= (select |c_old(#valid)| .cse9) 0) .cse6)))))) is different from false [2024-11-28 05:03:11,855 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse9))) (let ((.cse2 (store |c_old(#valid)| .cse9 .cse7))) (let ((.cse0 (@diff .cse2 |c_#valid|)) (.cse1 (= |c_#valid| .cse2)) (.cse8 (= |c_#valid| |c_old(#valid)|)) (.cse6 (= c_create_internal_~now~0.base .cse9))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) .cse1) (= |c_#valid| (store .cse2 .cse0 (select |c_#valid| .cse0))) (let ((.cse5 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))))) (or (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |c_#valid| .cse3))) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_43| .cse4))) (= .cse3 c_create_internal_~now~0.base)))) (and .cse5 .cse1 .cse6) (and (or (= .cse7 1) (and .cse8 .cse5)) .cse1))) (or .cse8 (= (select |c_old(#valid)| .cse9) 0) .cse6)))))) is different from true [2024-11-28 05:03:13,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse8) 1) (= .cse9 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_43| .cse8))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_old(#valid)_AFTER_CALL_44| .cse9)) |v_old(#valid)_AFTER_CALL_44|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_44| .cse10)) |v_old(#valid)_AFTER_CALL_44|) (= .cse10 c_create_internal_~now~0.base) (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from false [2024-11-28 05:03:13,241 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse8) 1) (= .cse9 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_43| .cse8))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_old(#valid)_AFTER_CALL_44| .cse9)) |v_old(#valid)_AFTER_CALL_44|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse10 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse10 (select |v_old(#valid)_AFTER_CALL_44| .cse10)) |v_old(#valid)_AFTER_CALL_44|) (= .cse10 c_create_internal_~now~0.base) (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) (and (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from true [2024-11-28 05:03:13,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse8 (store |c_old(#valid)| .cse4 .cse5))) (let ((.cse7 (@diff .cse8 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7))) (let ((.cse11 (store .cse8 .cse7 .cse6))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (and (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) .cse0) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3)) |v_old(#valid)_AFTER_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse4) 0) (= .cse5 1)) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) (= |c_#valid| .cse8)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (= |c_#valid| (store .cse11 .cse10 .cse9))))))))))) is different from false [2024-11-28 05:03:13,291 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse8 (store |c_old(#valid)| .cse4 .cse5))) (let ((.cse7 (@diff .cse8 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7))) (let ((.cse11 (store .cse8 .cse7 .cse6))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (and (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_33) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_43| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1))) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|) 1) |v_old(#valid)_AFTER_CALL_44|))) .cse0) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_44|))) (and (= (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_44| .cse3)) |v_old(#valid)_AFTER_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse3) 1)))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse4) 0) (= .cse5 1)) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) (= |c_#valid| .cse8)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (= |c_#valid| (store .cse11 .cse10 .cse9))))))))))) is different from true [2024-11-28 05:03:13,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_45| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)) |v_old(#valid)_AFTER_CALL_43|) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))))) (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse3 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_old(#valid)_AFTER_CALL_44| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse4) 1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|) 1)))) .cse3))))) is different from false [2024-11-28 05:03:13,406 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_43|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_45| .cse1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)) |v_old(#valid)_AFTER_CALL_43|) (= (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_44| .cse2)) |v_old(#valid)_AFTER_CALL_44|)))))) (and .cse0 (exists ((v_create_internal_~now~0.base_33 Int)) (= 1 (select |c_#valid| v_create_internal_~now~0.base_33))) .cse3 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_create_internal_~now~0.base_33 Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|))) (and (= (select |v_old(#valid)_AFTER_CALL_44| v_create_internal_~now~0.base_33) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_old(#valid)_AFTER_CALL_44| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse4) 1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_44| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_44| (store |v_old(#valid)_AFTER_CALL_45| (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_44|) 1)))) .cse3))))) is different from true [2024-11-28 05:03:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:14,758 INFO L93 Difference]: Finished difference Result 276 states and 385 transitions. [2024-11-28 05:03:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:03:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2024-11-28 05:03:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:14,760 INFO L225 Difference]: With dead ends: 276 [2024-11-28 05:03:14,760 INFO L226 Difference]: Without dead ends: 276 [2024-11-28 05:03:14,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=232, Invalid=731, Unknown=31, NotChecked=1168, Total=2162 [2024-11-28 05:03:14,762 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 215 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2273 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:14,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 793 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 882 Invalid, 0 Unknown, 2273 Unchecked, 3.3s Time] [2024-11-28 05:03:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-28 05:03:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 237. [2024-11-28 05:03:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 168 states have (on average 1.494047619047619) internal successors, (251), 198 states have internal predecessors, (251), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (51), 32 states have call predecessors, (51), 24 states have call successors, (51) [2024-11-28 05:03:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 326 transitions. [2024-11-28 05:03:14,776 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 326 transitions. Word has length 49 [2024-11-28 05:03:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 326 transitions. [2024-11-28 05:03:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 05:03:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 326 transitions. [2024-11-28 05:03:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:03:14,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:14,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:03:14,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:03:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:14,978 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:03:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1695480260, now seen corresponding path program 2 times [2024-11-28 05:03:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522691161] [2024-11-28 05:03:14,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:15,013 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:15,013 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:03:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522691161] [2024-11-28 05:03:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522691161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406976083] [2024-11-28 05:03:17,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:03:17,826 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:03:17,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:03:17,983 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:17,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:17,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-28 05:03:17,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:03:18,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:03:18,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:03:19,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:03:19,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2024-11-28 05:03:20,283 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-28 05:03:25,821 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2024-11-28 05:03:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 123 [2024-11-28 05:03:25,991 INFO L224 Elim1Store]: Index analysis took 114 ms [2024-11-28 05:03:26,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:03:26,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 233 [2024-11-28 05:03:31,325 INFO L349 Elim1Store]: treesize reduction 71, result has 6.6 percent of original size [2024-11-28 05:03:31,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 19 [2024-11-28 05:03:31,557 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2024-11-28 05:03:31,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 1 [2024-11-28 05:03:31,723 INFO L224 Elim1Store]: Index analysis took 103 ms [2024-11-28 05:03:31,806 INFO L349 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2024-11-28 05:03:31,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 1 [2024-11-28 05:03:31,959 INFO L349 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2024-11-28 05:03:31,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 1 [2024-11-28 05:03:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2024-11-28 05:03:32,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:03:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406976083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:34,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:03:34,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 31 [2024-11-28 05:03:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990943946] [2024-11-28 05:03:34,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:03:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:03:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:34,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:03:34,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=911, Unknown=2, NotChecked=62, Total=1122 [2024-11-28 05:03:34,117 INFO L87 Difference]: Start difference. First operand 237 states and 326 transitions. Second operand has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 05:03:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:42,714 INFO L93 Difference]: Finished difference Result 292 states and 401 transitions. [2024-11-28 05:03:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:03:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 49 [2024-11-28 05:03:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:42,716 INFO L225 Difference]: With dead ends: 292 [2024-11-28 05:03:42,716 INFO L226 Difference]: Without dead ends: 292 [2024-11-28 05:03:42,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=197, Invalid=1211, Unknown=2, NotChecked=72, Total=1482 [2024-11-28 05:03:42,717 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 122 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:42,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 731 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1664 Invalid, 0 Unknown, 244 Unchecked, 7.0s Time] [2024-11-28 05:03:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-28 05:03:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 243. [2024-11-28 05:03:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 174 states have (on average 1.5114942528735633) internal successors, (263), 202 states have internal predecessors, (263), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (51), 34 states have call predecessors, (51), 24 states have call successors, (51) [2024-11-28 05:03:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2024-11-28 05:03:42,728 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 49 [2024-11-28 05:03:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:42,728 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2024-11-28 05:03:42,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 05:03:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2024-11-28 05:03:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 05:03:42,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:42,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:03:42,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:03:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-28 05:03:42,930 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:03:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1431161706, now seen corresponding path program 1 times [2024-11-28 05:03:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899204624] [2024-11-28 05:03:42,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:03:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899204624] [2024-11-28 05:03:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899204624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921167476] [2024-11-28 05:03:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:48,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:03:48,766 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:03:48,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:03:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:48,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-28 05:03:48,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:03:48,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:03:50,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:03:50,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:03:51,956 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:03:51,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:03:52,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:03:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:03:52,907 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-28 05:03:53,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:03:53,163 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 05:03:53,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 51 [2024-11-28 05:03:53,265 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 05:03:53,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 05:03:53,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-28 05:03:53,690 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-28 05:03:53,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 34 [2024-11-28 05:03:53,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-28 05:03:56,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:03:56,201 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-28 05:03:56,202 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-28 05:03:56,252 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:03:56,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-28 05:03:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 05:03:56,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921167476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:06,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:04:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 51 [2024-11-28 05:04:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260323186] [2024-11-28 05:04:06,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 05:04:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:06,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 05:04:06,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3162, Unknown=2, NotChecked=112, Total=3422 [2024-11-28 05:04:06,242 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand has 51 states, 47 states have (on average 1.702127659574468) internal successors, (80), 38 states have internal predecessors, (80), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 05:04:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:25,535 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2024-11-28 05:04:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:04:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.702127659574468) internal successors, (80), 38 states have internal predecessors, (80), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 54 [2024-11-28 05:04:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:25,537 INFO L225 Difference]: With dead ends: 281 [2024-11-28 05:04:25,537 INFO L226 Difference]: Without dead ends: 281 [2024-11-28 05:04:25,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=300, Invalid=6022, Unknown=2, NotChecked=156, Total=6480 [2024-11-28 05:04:25,539 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 144 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 3730 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:25,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2747 Invalid, 3977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3730 Invalid, 0 Unknown, 186 Unchecked, 13.0s Time] [2024-11-28 05:04:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-28 05:04:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2024-11-28 05:04:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 218 states have internal predecessors, (281), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 36 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-28 05:04:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 363 transitions. [2024-11-28 05:04:25,552 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 363 transitions. Word has length 54 [2024-11-28 05:04:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:25,552 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 363 transitions. [2024-11-28 05:04:25,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.702127659574468) internal successors, (80), 38 states have internal predecessors, (80), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 05:04:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 363 transitions. [2024-11-28 05:04:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 05:04:25,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:25,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:04:25,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:04:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:04:25,754 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:04:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1559186858, now seen corresponding path program 2 times [2024-11-28 05:04:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433766284] [2024-11-28 05:04:25,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:04:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:25,778 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:04:25,778 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:04:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:04:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433766284] [2024-11-28 05:04:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433766284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012454296] [2024-11-28 05:04:28,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:04:28,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:28,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:28,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:04:28,930 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:04:28,930 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:04:28,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 05:04:28,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:29,375 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:04:29,434 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-28 05:04:29,440 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-28 05:04:29,490 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-28 05:04:29,496 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-28 05:04:29,799 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 .cse0) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse2 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse2 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)))))) is different from false [2024-11-28 05:04:29,806 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0))) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 .cse0) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse2 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse2 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)))))) is different from true [2024-11-28 05:04:30,501 INFO L349 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2024-11-28 05:04:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 48 [2024-11-28 05:04:30,532 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_133) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_67| (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse0 (@diff |v_#valid_BEFORE_CALL_67| |v_old(#valid)_AFTER_CALL_60|))) (and (= (store |v_#valid_BEFORE_CALL_67| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0)) |v_old(#valid)_AFTER_CALL_60|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= 1 (select .cse1 .cse0))))) (= (select |v_#valid_BEFORE_CALL_67| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-11-28 05:04:30,538 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_133) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_67| (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse0 (@diff |v_#valid_BEFORE_CALL_67| |v_old(#valid)_AFTER_CALL_60|))) (and (= (store |v_#valid_BEFORE_CALL_67| .cse0 (select |v_old(#valid)_AFTER_CALL_60| .cse0)) |v_old(#valid)_AFTER_CALL_60|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= 1 (select .cse1 .cse0))))) (= (select |v_#valid_BEFORE_CALL_67| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-11-28 05:04:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2024-11-28 05:04:30,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012454296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:31,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:04:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2024-11-28 05:04:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310235573] [2024-11-28 05:04:31,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:31,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:04:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:04:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=302, Unknown=9, NotChecked=200, Total=600 [2024-11-28 05:04:31,393 INFO L87 Difference]: Start difference. First operand 262 states and 363 transitions. Second operand has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 18 states have internal predecessors, (73), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 05:04:32,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse7))) (let ((.cse4 (@diff .cse14 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse4))) (let ((.cse12 (store .cse14 .cse4 .cse8))) (let ((.cse10 (@diff .cse12 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse4) 0)) (.cse6 (= |c_#valid| .cse14)) (.cse11 (= |c_#valid| .cse12)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 (= .cse2 |c_create_internal_#t~ret7.base|) .cse1) (or (= .cse4 |c_create_internal_#t~mem8.base|) .cse5 .cse6) (or .cse0 .cse1 (= .cse7 1)) (or (= .cse8 1) .cse5 .cse6) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) .cse11) (or (= .cse4 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse12 .cse10 .cse9)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_60| .cse13))) (= .cse13 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse4 c_create_internal_~now~0.base) .cse5 .cse6) (or (= .cse4 .cse3) .cse5 .cse6) .cse11 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse2))))))))))) is different from false [2024-11-28 05:04:32,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse7))) (let ((.cse4 (@diff .cse14 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse4))) (let ((.cse12 (store .cse14 .cse4 .cse8))) (let ((.cse10 (@diff .cse12 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse4) 0)) (.cse6 (= |c_#valid| .cse14)) (.cse11 (= |c_#valid| .cse12)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 (= .cse2 |c_create_internal_#t~ret7.base|) .cse1) (or (= .cse4 |c_create_internal_#t~mem8.base|) .cse5 .cse6) (or .cse0 .cse1 (= .cse7 1)) (or (= .cse8 1) .cse5 .cse6) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) .cse11) (or (= .cse4 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse12 .cse10 .cse9)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_60| .cse13))) (= .cse13 c_create_internal_~now~0.base) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse4 c_create_internal_~now~0.base) .cse5 .cse6) (or (= .cse4 .cse3) .cse5 .cse6) .cse11 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse2))))))))))) is different from true [2024-11-28 05:04:32,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) .cse10 (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse13) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_60| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from false [2024-11-28 05:04:32,453 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) .cse10 (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse13) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_60| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from true [2024-11-28 05:04:32,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) .cse10 (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_60| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from false [2024-11-28 05:04:32,489 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) .cse10 (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_60| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from true [2024-11-28 05:04:32,498 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse11))) (let ((.cse13 (store |c_old(#valid)| .cse11 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse11) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse11)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_60| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from false [2024-11-28 05:04:32,507 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse11))) (let ((.cse13 (store |c_old(#valid)| .cse11 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse11) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse11)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse12) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_60| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))))))))))))) is different from true [2024-11-28 05:04:32,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse2) 0) (= c_create_internal_~now~0.base .cse2)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_60| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))))))) is different from false [2024-11-28 05:04:32,525 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse2) 0) (= c_create_internal_~now~0.base .cse2)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse3 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= (select |c_#valid| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse3 (select |v_old(#valid)_AFTER_CALL_60| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_60| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))))))) is different from true [2024-11-28 05:04:33,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse9 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_60| .cse8))) (= |c_#valid| (store .cse9 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse9 .cse8) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse10 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse10 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse10 alloc_and_zero_internal_~pi~1.base 1))))))))))))))) is different from false [2024-11-28 05:04:33,478 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse9 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_60| .cse8))) (= |c_#valid| (store .cse9 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse9 .cse8) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse10 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse10 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse10 alloc_and_zero_internal_~pi~1.base 1))))))))))))))) is different from true [2024-11-28 05:04:33,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse9 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_60| .cse8))) (= |c_#valid| (store .cse9 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse9 .cse8) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse10 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse10 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse10 alloc_and_zero_internal_~pi~1.base 1))))))))))))))) is different from false [2024-11-28 05:04:33,500 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (or (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse9 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse8 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_60|))) (and (= |v_old(#valid)_AFTER_CALL_60| (store |c_old(#valid)| .cse8 (select |v_old(#valid)_AFTER_CALL_60| .cse8))) (= |c_#valid| (store .cse9 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse9 .cse8) 1)))) (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int) (alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int)) (let ((.cse10 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_133 1))) (and (= (select .cse10 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse10 alloc_and_zero_internal_~pi~1.base 1))))))))))))))) is different from true [2024-11-28 05:04:33,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_133) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_67| (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse2 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse1 (@diff |v_#valid_BEFORE_CALL_67| |v_old(#valid)_AFTER_CALL_60|))) (and (= (store |v_#valid_BEFORE_CALL_67| .cse1 (select |v_old(#valid)_AFTER_CALL_60| .cse1)) |v_old(#valid)_AFTER_CALL_60|) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)) (= 1 (select .cse2 .cse1))))) (= (select |v_#valid_BEFORE_CALL_67| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2024-11-28 05:04:33,516 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((v_alloc_and_zero_internal_~pi~1.base_133 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_133) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_67| (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_134 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (let ((.cse2 (store |v_old(#valid)_AFTER_CALL_60| v_alloc_and_zero_internal_~pi~1.base_134 1)) (.cse1 (@diff |v_#valid_BEFORE_CALL_67| |v_old(#valid)_AFTER_CALL_60|))) (and (= (store |v_#valid_BEFORE_CALL_67| .cse1 (select |v_old(#valid)_AFTER_CALL_60| .cse1)) |v_old(#valid)_AFTER_CALL_60|) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)) (= 1 (select .cse2 .cse1))))) (= (select |v_#valid_BEFORE_CALL_67| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2024-11-28 05:04:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:34,589 INFO L93 Difference]: Finished difference Result 292 states and 396 transitions. [2024-11-28 05:04:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 05:04:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 18 states have internal predecessors, (73), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 64 [2024-11-28 05:04:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:34,592 INFO L225 Difference]: With dead ends: 292 [2024-11-28 05:04:34,592 INFO L226 Difference]: Without dead ends: 292 [2024-11-28 05:04:34,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=186, Invalid=491, Unknown=25, NotChecked=780, Total=1482 [2024-11-28 05:04:34,595 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 127 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1478 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:34,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 624 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 650 Invalid, 0 Unknown, 1478 Unchecked, 2.5s Time] [2024-11-28 05:04:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-28 05:04:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 261. [2024-11-28 05:04:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 189 states have (on average 1.4761904761904763) internal successors, (279), 218 states have internal predecessors, (279), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 35 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-28 05:04:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 361 transitions. [2024-11-28 05:04:34,605 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 361 transitions. Word has length 64 [2024-11-28 05:04:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:34,605 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 361 transitions. [2024-11-28 05:04:34,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 18 states have internal predecessors, (73), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 05:04:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 361 transitions. [2024-11-28 05:04:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 05:04:34,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:34,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:04:34,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:04:34,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 05:04:34,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:04:34,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash 464232452, now seen corresponding path program 1 times [2024-11-28 05:04:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749828616] [2024-11-28 05:04:34,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:04:36,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749828616] [2024-11-28 05:04:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749828616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:04:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:04:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:04:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894636111] [2024-11-28 05:04:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:04:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:04:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:36,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:04:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:04:36,446 INFO L87 Difference]: Start difference. First operand 261 states and 361 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:40,534 INFO L93 Difference]: Finished difference Result 282 states and 383 transitions. [2024-11-28 05:04:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 05:04:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2024-11-28 05:04:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:40,536 INFO L225 Difference]: With dead ends: 282 [2024-11-28 05:04:40,536 INFO L226 Difference]: Without dead ends: 282 [2024-11-28 05:04:40,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:04:40,537 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 33 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:40,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1554 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 05:04:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-28 05:04:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 272. [2024-11-28 05:04:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 198 states have (on average 1.47979797979798) internal successors, (293), 227 states have internal predecessors, (293), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (57), 36 states have call predecessors, (57), 27 states have call successors, (57) [2024-11-28 05:04:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 377 transitions. [2024-11-28 05:04:40,550 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 377 transitions. Word has length 58 [2024-11-28 05:04:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:40,550 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 377 transitions. [2024-11-28 05:04:40,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 377 transitions. [2024-11-28 05:04:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 05:04:40,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:40,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:04:40,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:04:40,552 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:04:40,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash 464232453, now seen corresponding path program 1 times [2024-11-28 05:04:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:40,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297262602] [2024-11-28 05:04:40,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:04:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:42,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297262602] [2024-11-28 05:04:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297262602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:04:42,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:04:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:04:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36000891] [2024-11-28 05:04:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:04:42,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:04:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:42,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:04:42,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:04:42,465 INFO L87 Difference]: Start difference. First operand 272 states and 377 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:46,395 INFO L93 Difference]: Finished difference Result 282 states and 382 transitions. [2024-11-28 05:04:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 05:04:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2024-11-28 05:04:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:46,398 INFO L225 Difference]: With dead ends: 282 [2024-11-28 05:04:46,398 INFO L226 Difference]: Without dead ends: 282 [2024-11-28 05:04:46,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:04:46,399 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 32 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:46,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1639 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 05:04:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-28 05:04:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 272. [2024-11-28 05:04:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 198 states have (on average 1.4747474747474747) internal successors, (292), 227 states have internal predecessors, (292), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (57), 36 states have call predecessors, (57), 27 states have call successors, (57) [2024-11-28 05:04:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 376 transitions. [2024-11-28 05:04:46,410 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 376 transitions. Word has length 58 [2024-11-28 05:04:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:46,411 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 376 transitions. [2024-11-28 05:04:46,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 376 transitions. [2024-11-28 05:04:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 05:04:46,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:46,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:04:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:04:46,413 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:04:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1380075029, now seen corresponding path program 1 times [2024-11-28 05:04:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254747278] [2024-11-28 05:04:46,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:04:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254747278] [2024-11-28 05:04:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254747278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103480703] [2024-11-28 05:04:53,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:53,544 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:53,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:04:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:53,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-28 05:04:53,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:04:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:04:56,029 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-28 05:04:57,271 INFO L349 Elim1Store]: treesize reduction 132, result has 25.4 percent of original size [2024-11-28 05:04:57,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 67 [2024-11-28 05:04:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2024-11-28 05:04:57,743 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2024-11-28 05:04:59,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 17 [2024-11-28 05:05:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-28 05:05:00,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:05:02,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_alloc_and_zero_internal_~pi~1.base_165 Int) (v_create_internal_~sll~0.base_39 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1447 Int)) (let ((.cse0 (store |c_#valid| v_create_internal_~sll~0.base_39 1))) (or (not (= (select |c_#valid| v_create_internal_~sll~0.base_39) 0)) (= (select (store .cse0 v_alloc_and_zero_internal_~pi~1.base_165 1) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_165 v_ArrVal_1461) v_create_internal_~sll~0.base_39 v_ArrVal_1462))) (store .cse1 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) (+ |c_ULTIMATE.start_create_~now~1#1.offset| 16) v_ArrVal_1447))) |c_ULTIMATE.start_create_~sll~1#1.base|) (+ 8 |c_ULTIMATE.start_create_~sll~1#1.offset|))) 1) (not (= (select .cse0 v_alloc_and_zero_internal_~pi~1.base_165) 0))))) is different from false [2024-11-28 05:05:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103480703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:05:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 49 [2024-11-28 05:05:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065466955] [2024-11-28 05:05:02,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:05:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 05:05:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 05:05:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2586, Unknown=2, NotChecked=206, Total=2970 [2024-11-28 05:05:02,469 INFO L87 Difference]: Start difference. First operand 272 states and 376 transitions. Second operand has 50 states, 45 states have (on average 2.0) internal successors, (90), 37 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 05:05:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:19,417 INFO L93 Difference]: Finished difference Result 327 states and 436 transitions. [2024-11-28 05:05:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 05:05:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.0) internal successors, (90), 37 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Word has length 63 [2024-11-28 05:05:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:19,419 INFO L225 Difference]: With dead ends: 327 [2024-11-28 05:05:19,419 INFO L226 Difference]: Without dead ends: 327 [2024-11-28 05:05:19,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=327, Invalid=4935, Unknown=2, NotChecked=286, Total=5550 [2024-11-28 05:05:19,422 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 149 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:19,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1800 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3489 Invalid, 5 Unknown, 272 Unchecked, 12.7s Time] [2024-11-28 05:05:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-28 05:05:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 293. [2024-11-28 05:05:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 217 states have (on average 1.4700460829493087) internal successors, (319), 245 states have internal predecessors, (319), 28 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (58), 38 states have call predecessors, (58), 28 states have call successors, (58) [2024-11-28 05:05:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2024-11-28 05:05:19,434 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 63 [2024-11-28 05:05:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:19,434 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2024-11-28 05:05:19,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.0) internal successors, (90), 37 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 05:05:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2024-11-28 05:05:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 05:05:19,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:19,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:19,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:05:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 05:05:19,640 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:05:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1380075030, now seen corresponding path program 1 times [2024-11-28 05:05:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817560921] [2024-11-28 05:05:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:05:30,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:30,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817560921] [2024-11-28 05:05:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817560921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237217559] [2024-11-28 05:05:30,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:30,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:30,681 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:05:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:30,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-28 05:05:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:31,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:05:31,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:05:31,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:05:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:05:46,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:05:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:05:46,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-28 05:05:47,175 INFO L349 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2024-11-28 05:05:47,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 41 [2024-11-28 05:05:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2024-11-28 05:05:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-28 05:05:47,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 05:05:47,615 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-28 05:05:48,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 05:05:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 05:05:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:05:50,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:05:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237217559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:54,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:05:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 50 [2024-11-28 05:05:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190164915] [2024-11-28 05:05:54,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:05:54,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 05:05:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:54,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 05:05:54,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3229, Unknown=4, NotChecked=0, Total=3422 [2024-11-28 05:05:54,340 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 51 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 38 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 05:06:07,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:12,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:18,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:23,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:30,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:35,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:40,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:47,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:06:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:49,038 INFO L93 Difference]: Finished difference Result 322 states and 433 transitions. [2024-11-28 05:06:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 05:06:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 38 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Word has length 63 [2024-11-28 05:06:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:49,049 INFO L225 Difference]: With dead ends: 322 [2024-11-28 05:06:49,050 INFO L226 Difference]: Without dead ends: 322 [2024-11-28 05:06:49,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=340, Invalid=5662, Unknown=4, NotChecked=0, Total=6006 [2024-11-28 05:06:49,054 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 130 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 39 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:49,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2024 Invalid, 3383 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 3335 Invalid, 9 Unknown, 0 Unchecked, 48.2s Time] [2024-11-28 05:06:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-28 05:06:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 293. [2024-11-28 05:06:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 217 states have (on average 1.4654377880184333) internal successors, (318), 245 states have internal predecessors, (318), 28 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (58), 38 states have call predecessors, (58), 28 states have call successors, (58) [2024-11-28 05:06:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2024-11-28 05:06:49,109 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 63 [2024-11-28 05:06:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:49,113 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2024-11-28 05:06:49,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 38 states have internal predecessors, (90), 10 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 05:06:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2024-11-28 05:06:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-28 05:06:49,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:49,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:49,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:49,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 05:06:49,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:06:49,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash 154267311, now seen corresponding path program 1 times [2024-11-28 05:06:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:49,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197455625] [2024-11-28 05:06:49,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:06:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197455625] [2024-11-28 05:06:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197455625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410926623] [2024-11-28 05:06:52,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:52,554 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:52,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:06:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:52,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-28 05:06:52,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:06:53,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:06:54,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:54,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:06:55,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:06:55,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:06:57,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:06:57,957 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-28 05:06:57,957 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-28 05:06:57,999 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:06:57,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-28 05:06:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:58,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410926623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:00,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2024-11-28 05:07:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752324850] [2024-11-28 05:07:00,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 05:07:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:00,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 05:07:00,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2042, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 05:07:00,287 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand has 43 states, 40 states have (on average 2.3) internal successors, (92), 34 states have internal predecessors, (92), 11 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-28 05:07:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:19,821 INFO L93 Difference]: Finished difference Result 405 states and 527 transitions. [2024-11-28 05:07:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-28 05:07:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.3) internal successors, (92), 34 states have internal predecessors, (92), 11 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 61 [2024-11-28 05:07:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:19,825 INFO L225 Difference]: With dead ends: 405 [2024-11-28 05:07:19,825 INFO L226 Difference]: Without dead ends: 401 [2024-11-28 05:07:19,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=324, Invalid=4932, Unknown=0, NotChecked=0, Total=5256 [2024-11-28 05:07:19,828 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 217 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 3547 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:19,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 3547 Invalid, 4312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2024-11-28 05:07:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-28 05:07:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 309. [2024-11-28 05:07:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 257 states have internal predecessors, (334), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (60), 41 states have call predecessors, (60), 30 states have call successors, (60) [2024-11-28 05:07:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 424 transitions. [2024-11-28 05:07:19,848 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 424 transitions. Word has length 61 [2024-11-28 05:07:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 424 transitions. [2024-11-28 05:07:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.3) internal successors, (92), 34 states have internal predecessors, (92), 11 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-28 05:07:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 424 transitions. [2024-11-28 05:07:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-28 05:07:19,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:19,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:07:19,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 05:07:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 05:07:20,052 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:07:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1906752770, now seen corresponding path program 1 times [2024-11-28 05:07:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627071580] [2024-11-28 05:07:20,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:07:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627071580] [2024-11-28 05:07:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627071580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011886434] [2024-11-28 05:07:31,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:31,373 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:31,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:07:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:31,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-28 05:07:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:31,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:07:32,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:07:32,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:07:34,954 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:07:34,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:07:35,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:07:35,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:07:38,306 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-28 05:07:39,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,869 INFO L349 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2024-11-28 05:07:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 51 [2024-11-28 05:07:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:39,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-28 05:07:40,079 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-11-28 05:07:40,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2024-11-28 05:07:40,513 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-28 05:07:40,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 34 [2024-11-28 05:07:40,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-28 05:07:43,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:07:43,235 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-28 05:07:43,235 INFO L378 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-28 05:07:43,284 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:07:43,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-28 05:07:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-28 05:07:43,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:51,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011886434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:51,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 65 [2024-11-28 05:07:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702773047] [2024-11-28 05:07:51,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-28 05:07:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:51,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-28 05:07:51,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4897, Unknown=1, NotChecked=140, Total=5256 [2024-11-28 05:07:51,023 INFO L87 Difference]: Start difference. First operand 309 states and 424 transitions. Second operand has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 49 states have internal predecessors, (101), 11 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-28 05:08:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:18,927 INFO L93 Difference]: Finished difference Result 350 states and 473 transitions. [2024-11-28 05:08:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:08:18,927 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 49 states have internal predecessors, (101), 11 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) Word has length 66 [2024-11-28 05:08:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:18,930 INFO L225 Difference]: With dead ends: 350 [2024-11-28 05:08:18,930 INFO L226 Difference]: Without dead ends: 350 [2024-11-28 05:08:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=377, Invalid=7816, Unknown=1, NotChecked=178, Total=8372 [2024-11-28 05:08:18,938 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 92 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3175 Invalid, 4762 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 4514 Invalid, 0 Unknown, 216 Unchecked, 16.4s Time] [2024-11-28 05:08:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-28 05:08:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 325. [2024-11-28 05:08:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 244 states have (on average 1.4344262295081966) internal successors, (350), 271 states have internal predecessors, (350), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (61), 42 states have call predecessors, (61), 31 states have call successors, (61) [2024-11-28 05:08:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 442 transitions. [2024-11-28 05:08:18,972 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 442 transitions. Word has length 66 [2024-11-28 05:08:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:18,973 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 442 transitions. [2024-11-28 05:08:18,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 49 states have internal predecessors, (101), 11 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-28 05:08:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 442 transitions. [2024-11-28 05:08:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:08:18,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:18,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:18,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 05:08:19,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:08:19,180 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:08:19,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1750399371, now seen corresponding path program 1 times [2024-11-28 05:08:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918100977] [2024-11-28 05:08:19,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 05:08:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918100977] [2024-11-28 05:08:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918100977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:08:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775280538] [2024-11-28 05:08:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:20,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:08:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:20,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:08:20,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:08:20,015 INFO L87 Difference]: Start difference. First operand 325 states and 442 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:08:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:22,346 INFO L93 Difference]: Finished difference Result 341 states and 463 transitions. [2024-11-28 05:08:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:08:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-28 05:08:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:22,348 INFO L225 Difference]: With dead ends: 341 [2024-11-28 05:08:22,348 INFO L226 Difference]: Without dead ends: 341 [2024-11-28 05:08:22,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:08:22,349 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 30 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:22,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 683 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:08:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-28 05:08:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 328. [2024-11-28 05:08:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 247 states have (on average 1.4412955465587045) internal successors, (356), 271 states have internal predecessors, (356), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (61), 45 states have call predecessors, (61), 31 states have call successors, (61) [2024-11-28 05:08:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 448 transitions. [2024-11-28 05:08:22,373 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 448 transitions. Word has length 68 [2024-11-28 05:08:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:22,373 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 448 transitions. [2024-11-28 05:08:22,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:08:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 448 transitions. [2024-11-28 05:08:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:08:22,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:22,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:08:22,377 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:08:22,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1750399372, now seen corresponding path program 1 times [2024-11-28 05:08:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:22,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633788506] [2024-11-28 05:08:22,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:08:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633788506] [2024-11-28 05:08:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633788506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913339972] [2024-11-28 05:08:23,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:23,639 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:23,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:08:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:23,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 05:08:23,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:23,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:08:23,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:08:24,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:08:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:08:24,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-28 05:08:24,727 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-28 05:08:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:24,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 05:08:24,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:24,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:08:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:08:25,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:08:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913339972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:08:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2024-11-28 05:08:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815149718] [2024-11-28 05:08:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:08:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:25,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:08:25,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=297, Unknown=1, NotChecked=34, Total=380 [2024-11-28 05:08:25,005 INFO L87 Difference]: Start difference. First operand 328 states and 448 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:08:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:26,933 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2024-11-28 05:08:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:08:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-28 05:08:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:26,935 INFO L225 Difference]: With dead ends: 341 [2024-11-28 05:08:26,935 INFO L226 Difference]: Without dead ends: 341 [2024-11-28 05:08:26,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2024-11-28 05:08:26,936 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 24 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:26,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 442 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 584 Invalid, 0 Unknown, 260 Unchecked, 1.8s Time] [2024-11-28 05:08:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-28 05:08:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 328. [2024-11-28 05:08:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 247 states have (on average 1.4291497975708503) internal successors, (353), 271 states have internal predecessors, (353), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (61), 45 states have call predecessors, (61), 31 states have call successors, (61) [2024-11-28 05:08:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 445 transitions. [2024-11-28 05:08:26,947 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 445 transitions. Word has length 68 [2024-11-28 05:08:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 445 transitions. [2024-11-28 05:08:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:08:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 445 transitions. [2024-11-28 05:08:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:08:26,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:26,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:26,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 05:08:27,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:27,155 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:08:27,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1630193044, now seen corresponding path program 1 times [2024-11-28 05:08:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231462045] [2024-11-28 05:08:27,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-28 05:08:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231462045] [2024-11-28 05:08:28,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231462045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837912693] [2024-11-28 05:08:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:28,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:28,646 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:28,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:08:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:28,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 05:08:28,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:29,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:08:29,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 05:08:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-28 05:08:29,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:30,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-28 05:08:30,392 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:08:30,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-28 05:08:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-28 05:08:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837912693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:30,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:30,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 23 [2024-11-28 05:08:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545034208] [2024-11-28 05:08:30,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:30,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:08:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:30,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:08:30,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:08:30,533 INFO L87 Difference]: Start difference. First operand 328 states and 445 transitions. Second operand has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-28 05:08:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:34,878 INFO L93 Difference]: Finished difference Result 411 states and 536 transitions. [2024-11-28 05:08:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 05:08:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 70 [2024-11-28 05:08:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:34,881 INFO L225 Difference]: With dead ends: 411 [2024-11-28 05:08:34,881 INFO L226 Difference]: Without dead ends: 411 [2024-11-28 05:08:34,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-11-28 05:08:34,882 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:34,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1629 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 05:08:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-28 05:08:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 339. [2024-11-28 05:08:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 256 states have (on average 1.43359375) internal successors, (367), 280 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 15 states have return successors, (62), 46 states have call predecessors, (62), 32 states have call successors, (62) [2024-11-28 05:08:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 461 transitions. [2024-11-28 05:08:34,899 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 461 transitions. Word has length 70 [2024-11-28 05:08:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:34,902 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 461 transitions. [2024-11-28 05:08:34,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-28 05:08:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 461 transitions. [2024-11-28 05:08:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:08:34,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:34,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:34,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-28 05:08:35,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-28 05:08:35,104 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:08:35,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1630193043, now seen corresponding path program 1 times [2024-11-28 05:08:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798114594] [2024-11-28 05:08:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798114594] [2024-11-28 05:08:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798114594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071278610] [2024-11-28 05:08:38,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:38,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:38,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:38,001 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:38,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 05:08:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:38,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 05:08:38,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:39,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:08:39,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:08:40,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 05:08:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:08:41,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:42,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-28 05:08:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:42,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:42,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:43,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:43,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-28 05:08:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:08:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071278610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:45,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 52 [2024-11-28 05:08:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118861159] [2024-11-28 05:08:45,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:45,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 05:08:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:45,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 05:08:45,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2592, Unknown=0, NotChecked=0, Total=2756 [2024-11-28 05:08:45,020 INFO L87 Difference]: Start difference. First operand 339 states and 461 transitions. Second operand has 53 states, 49 states have (on average 2.510204081632653) internal successors, (123), 42 states have internal predecessors, (123), 12 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (17), 16 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-28 05:08:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:57,582 INFO L93 Difference]: Finished difference Result 420 states and 537 transitions. [2024-11-28 05:08:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:08:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 49 states have (on average 2.510204081632653) internal successors, (123), 42 states have internal predecessors, (123), 12 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (17), 16 states have call predecessors, (17), 9 states have call successors, (17) Word has length 70 [2024-11-28 05:08:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:57,584 INFO L225 Difference]: With dead ends: 420 [2024-11-28 05:08:57,584 INFO L226 Difference]: Without dead ends: 420 [2024-11-28 05:08:57,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=288, Invalid=4404, Unknown=0, NotChecked=0, Total=4692 [2024-11-28 05:08:57,586 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 288 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:57,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1726 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 05:08:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-28 05:08:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 339. [2024-11-28 05:08:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 256 states have (on average 1.4296875) internal successors, (366), 280 states have internal predecessors, (366), 32 states have call successors, (32), 12 states have call predecessors, (32), 15 states have return successors, (62), 46 states have call predecessors, (62), 32 states have call successors, (62) [2024-11-28 05:08:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 460 transitions. [2024-11-28 05:08:57,604 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 460 transitions. Word has length 70 [2024-11-28 05:08:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:57,605 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 460 transitions. [2024-11-28 05:08:57,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 49 states have (on average 2.510204081632653) internal successors, (123), 42 states have internal predecessors, (123), 12 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (17), 16 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-28 05:08:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 460 transitions. [2024-11-28 05:08:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 05:08:57,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:57,606 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:57,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 05:08:57,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 05:08:57,807 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-28 05:08:57,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1621548734, now seen corresponding path program 3 times [2024-11-28 05:08:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:57,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972927638] [2024-11-28 05:08:57,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:08:57,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:57,860 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:08:57,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:09:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 05:09:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972927638] [2024-11-28 05:09:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972927638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724759965] [2024-11-28 05:09:03,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:09:03,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:03,300 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:03,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fff53a88-182f-4a6c-afcb-940bcbfb813b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 05:09:03,677 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:09:03,677 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:09:03,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 05:09:03,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:09:04,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-28 05:09:04,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= (select .cse0 |c_create_internal_#t~mem8.base|) 0) (= |c_#valid| (store .cse0 |c_create_internal_#t~mem8.base| (select |c_#valid| |c_create_internal_#t~mem8.base|))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) is different from true [2024-11-28 05:09:05,054 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_111| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_111| (store .cse0 c_create_internal_~now~0.base (select |v_old(#valid)_AFTER_CALL_111| c_create_internal_~now~0.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= |c_create_internal_#t~ret7.base| .cse1)))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse0 c_create_internal_~now~0.base) 0)))) (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= (store .cse2 c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) |c_#valid|) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse2 c_create_internal_~now~0.base) 0))))) is different from false [2024-11-28 05:09:05,060 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_111| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_111| (store .cse0 c_create_internal_~now~0.base (select |v_old(#valid)_AFTER_CALL_111| c_create_internal_~now~0.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= |c_create_internal_#t~ret7.base| .cse1)))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse0 c_create_internal_~now~0.base) 0)))) (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= (store .cse2 c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) |c_#valid|) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse2 c_create_internal_~now~0.base) 0))))) is different from true [2024-11-28 05:09:05,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:09:05,153 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_111| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_111| (store .cse0 c_create_internal_~now~0.base (select |v_old(#valid)_AFTER_CALL_111| c_create_internal_~now~0.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset) .cse1)))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse0 c_create_internal_~now~0.base) 0)))) (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= (store .cse2 c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) |c_#valid|) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse2 c_create_internal_~now~0.base) 0))))) is different from false [2024-11-28 05:09:05,160 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_111| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|))) (and (= |v_old(#valid)_AFTER_CALL_111| (store .cse0 c_create_internal_~now~0.base (select |v_old(#valid)_AFTER_CALL_111| c_create_internal_~now~0.base))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset) .cse1)))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse0 c_create_internal_~now~0.base) 0)))) (exists ((v_create_internal_~now~0.base_85 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= (store .cse2 c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) |c_#valid|) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0) (= (select .cse2 c_create_internal_~now~0.base) 0))))) is different from true [2024-11-28 05:09:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2024-11-28 05:09:05,336 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86))) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|)) (.cse2 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= |c_create_internal_#t~mem8.base| .cse1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse2 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse2 v_create_internal_~now~0.base_86) 0))))) is different from false [2024-11-28 05:09:05,343 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86))) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|)) (.cse2 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= |c_create_internal_#t~mem8.base| .cse1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse2 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse2 v_create_internal_~now~0.base_86) 0))))) is different from true [2024-11-28 05:09:05,432 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86))) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|)) (.cse2 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= c_create_internal_~now~0.base .cse1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse2 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse2 v_create_internal_~now~0.base_86) 0))))) is different from false [2024-11-28 05:09:05,438 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86))) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_111| |c_#valid|)) (.cse2 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_111| .cse1 (select |c_#valid| .cse1))) (= c_create_internal_~now~0.base .cse1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse2 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse2 v_create_internal_~now~0.base_86) 0))))) is different from true [2024-11-28 05:09:05,613 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-28 05:09:05,795 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (not (= v_create_internal_~now~0.base_86 alloc_and_zero_internal_~pi~1.base)) (= |c_#valid| (store (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86)) alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse1 v_create_internal_~now~0.base_86 1)) (= (select .cse1 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_112| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_112| alloc_and_zero_internal_~pi~1.base 1)) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_111| |v_old(#valid)_AFTER_CALL_112|)) (.cse3 (store |c_old(#valid)| v_prenex_89 1))) (and (= |v_old(#valid)_AFTER_CALL_112| (store |v_old(#valid)_AFTER_CALL_111| .cse2 (select |v_old(#valid)_AFTER_CALL_112| .cse2))) (= .cse2 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_111| (store .cse3 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse3 v_create_internal_~now~0.base_86) 0))))))) is different from false [2024-11-28 05:09:05,802 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (not (= v_create_internal_~now~0.base_86 alloc_and_zero_internal_~pi~1.base)) (= |c_#valid| (store (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86)) alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse1 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse1 v_create_internal_~now~0.base_86 1)) (= (select .cse1 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_112| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_112| alloc_and_zero_internal_~pi~1.base 1)) (exists ((v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_111| |v_old(#valid)_AFTER_CALL_112|)) (.cse3 (store |c_old(#valid)| v_prenex_89 1))) (and (= |v_old(#valid)_AFTER_CALL_112| (store |v_old(#valid)_AFTER_CALL_111| .cse2 (select |v_old(#valid)_AFTER_CALL_112| .cse2))) (= .cse2 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_111| (store .cse3 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse3 v_create_internal_~now~0.base_86) 0))))))) is different from true [2024-11-28 05:09:05,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (not (= v_create_internal_~now~0.base_86 alloc_and_zero_internal_~pi~1.base)) (= |c_#valid| (store (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86)) alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) .cse1) (and (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse2 v_create_internal_~now~0.base_86 1)) (= (select .cse2 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_112| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_111| |v_old(#valid)_AFTER_CALL_112|)) (.cse4 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_112| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_112| (store |v_old(#valid)_AFTER_CALL_111| .cse3 (select |v_old(#valid)_AFTER_CALL_112| .cse3))) (= (select |c_#valid| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse4 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse4 v_create_internal_~now~0.base_86) 0)))))) is different from false [2024-11-28 05:09:05,963 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse0 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (not (= v_create_internal_~now~0.base_86 alloc_and_zero_internal_~pi~1.base)) (= |c_#valid| (store (store .cse0 v_create_internal_~now~0.base_86 (select |c_#valid| v_create_internal_~now~0.base_86)) alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) .cse1) (and (exists ((v_create_internal_~now~0.base_85 Int) (v_create_internal_~now~0.base_86 Int)) (let ((.cse2 (store |c_old(#valid)| v_create_internal_~now~0.base_85 1))) (and (= |c_#valid| (store .cse2 v_create_internal_~now~0.base_86 1)) (= (select .cse2 v_create_internal_~now~0.base_86) 0) (= (select |c_old(#valid)| v_create_internal_~now~0.base_85) 0)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_89 Int) (|v_old(#valid)_AFTER_CALL_112| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_111| (Array Int Int)) (v_create_internal_~now~0.base_86 Int)) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_111| |v_old(#valid)_AFTER_CALL_112|)) (.cse4 (store |c_old(#valid)| v_prenex_89 1))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_112| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_112| (store |v_old(#valid)_AFTER_CALL_111| .cse3 (select |v_old(#valid)_AFTER_CALL_112| .cse3))) (= (select |c_#valid| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_111| (store .cse4 v_create_internal_~now~0.base_86 (select |v_old(#valid)_AFTER_CALL_111| v_create_internal_~now~0.base_86))) (= (select |c_old(#valid)| v_prenex_89) 0) (= (select .cse4 v_create_internal_~now~0.base_86) 0)))))) is different from true [2024-11-28 05:09:09,465 INFO L349 Elim1Store]: treesize reduction 685, result has 24.5 percent of original size [2024-11-28 05:09:09,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 125 treesize of output 403