./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya --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 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:22:24,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:22:24,585 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 03:22:24,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:22:24,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:22:24,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:22:24,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:22:24,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:22:24,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:22:24,614 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:22:24,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:22:24,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:22:24,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:22:24,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:22:24,617 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:22:24,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:22:24,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:22:24,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:22:24,619 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:22:24,620 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:22:24,620 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:22:24,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:22:24,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:22:24,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:22:24,622 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:22:24,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:22:24,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:22:24,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:22:24,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:22:24,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:22:24,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:22:24,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:22:24,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:22:24,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:22:24,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:22:24,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:22:24,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:22:24,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:22:24,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2023-11-29 03:22:24,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:22:24,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:22:24,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:22:24,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:22:24,876 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:22:24,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2023-11-29 03:22:27,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:22:27,952 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:22:27,953 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2023-11-29 03:22:27,980 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/data/5ffc64c36/817095fb65004b99b09388951dba3c2b/FLAGe0f4c30b5 [2023-11-29 03:22:27,992 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/data/5ffc64c36/817095fb65004b99b09388951dba3c2b [2023-11-29 03:22:27,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:22:27,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:22:27,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:22:27,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:22:28,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:22:28,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:22:27" (1/1) ... [2023-11-29 03:22:28,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ea1737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28, skipping insertion in model container [2023-11-29 03:22:28,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:22:27" (1/1) ... [2023-11-29 03:22:28,056 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:22:28,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:22:28,306 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:22:28,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:22:28,365 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:22:28,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28 WrapperNode [2023-11-29 03:22:28,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:22:28,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:22:28,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:22:28,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:22:28,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,408 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 80 [2023-11-29 03:22:28,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:22:28,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:22:28,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:22:28,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:22:28,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,439 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 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]. [2023-11-29 03:22:28,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:22:28,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:22:28,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:22:28,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:22:28,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (1/1) ... [2023-11-29 03:22:28,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:22:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:28,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:22:28,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:22:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:22:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-29 03:22:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-29 03:22:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:22:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:22:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:22:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:22:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:22:28,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:22:28,631 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:22:28,633 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:22:28,919 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:22:28,970 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:22:28,970 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 03:22:28,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:22:28 BoogieIcfgContainer [2023-11-29 03:22:28,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:22:28,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:22:28,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:22:28,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:22:28,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:22:27" (1/3) ... [2023-11-29 03:22:28,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d99ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:22:28, skipping insertion in model container [2023-11-29 03:22:28,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:22:28" (2/3) ... [2023-11-29 03:22:28,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d99ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:22:28, skipping insertion in model container [2023-11-29 03:22:28,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:22:28" (3/3) ... [2023-11-29 03:22:28,980 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2023-11-29 03:22:28,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:22:28,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-29 03:22:29,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:22:29,042 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68968ad9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:22:29,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-11-29 03:22:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 30 states have (on average 2.4) internal successors, (72), 66 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:22:29,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:29,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:22:29,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:29,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 5092341, now seen corresponding path program 1 times [2023-11-29 03:22:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:29,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645651357] [2023-11-29 03:22:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645651357] [2023-11-29 03:22:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645651357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:22:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43555118] [2023-11-29 03:22:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:22:29,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:22:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:22:29,292 INFO L87 Difference]: Start difference. First operand has 70 states, 30 states have (on average 2.4) internal successors, (72), 66 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-29 03:22:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:29,400 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-11-29 03:22:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:22:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-29 03:22:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:29,409 INFO L225 Difference]: With dead ends: 66 [2023-11-29 03:22:29,409 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 03:22:29,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:22:29,414 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:29,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 03:22:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 03:22:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-29 03:22:29,447 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 4 [2023-11-29 03:22:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:29,448 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-29 03:22:29,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-29 03:22:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-29 03:22:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:22:29,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:29,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:22:29,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:22:29,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:29,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash 5092342, now seen corresponding path program 1 times [2023-11-29 03:22:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966526657] [2023-11-29 03:22:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966526657] [2023-11-29 03:22:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966526657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:22:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974644436] [2023-11-29 03:22:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:29,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:22:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:22:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:22:29,545 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-29 03:22:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:29,627 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-11-29 03:22:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:22:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-29 03:22:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:29,629 INFO L225 Difference]: With dead ends: 61 [2023-11-29 03:22:29,629 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 03:22:29,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:22:29,631 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:29,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 03:22:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 03:22:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 30 states have (on average 2.0) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2023-11-29 03:22:29,640 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 4 [2023-11-29 03:22:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:29,641 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2023-11-29 03:22:29,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-29 03:22:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2023-11-29 03:22:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:22:29,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:29,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:29,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:22:29,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:29,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1088257845, now seen corresponding path program 1 times [2023-11-29 03:22:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927002067] [2023-11-29 03:22:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927002067] [2023-11-29 03:22:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927002067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:29,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:22:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338549013] [2023-11-29 03:22:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:29,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:22:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:22:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:22:29,891 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:30,079 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-11-29 03:22:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:22:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 03:22:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:30,083 INFO L225 Difference]: With dead ends: 59 [2023-11-29 03:22:30,084 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 03:22:30,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:30,086 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:30,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 03:22:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-11-29 03:22:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.8) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2023-11-29 03:22:30,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 10 [2023-11-29 03:22:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:30,096 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2023-11-29 03:22:30,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2023-11-29 03:22:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:22:30,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:30,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:30,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:22:30,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:30,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1088257846, now seen corresponding path program 1 times [2023-11-29 03:22:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434151747] [2023-11-29 03:22:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434151747] [2023-11-29 03:22:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434151747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:30,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:22:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59310340] [2023-11-29 03:22:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:30,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:22:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:22:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:22:30,369 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:30,547 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-11-29 03:22:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:22:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-29 03:22:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:30,549 INFO L225 Difference]: With dead ends: 57 [2023-11-29 03:22:30,549 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 03:22:30,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:30,551 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:30,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 03:22:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2023-11-29 03:22:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2023-11-29 03:22:30,557 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 10 [2023-11-29 03:22:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:30,558 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2023-11-29 03:22:30,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2023-11-29 03:22:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 03:22:30,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:30,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:30,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:22:30,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:30,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1724489561, now seen corresponding path program 1 times [2023-11-29 03:22:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942490305] [2023-11-29 03:22:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942490305] [2023-11-29 03:22:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942490305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:22:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933543610] [2023-11-29 03:22:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:22:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:22:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:30,736 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:30,905 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-29 03:22:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:22:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-29 03:22:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:30,908 INFO L225 Difference]: With dead ends: 61 [2023-11-29 03:22:30,908 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 03:22:30,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:30,909 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:30,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 03:22:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-11-29 03:22:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2023-11-29 03:22:30,916 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 16 [2023-11-29 03:22:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:30,917 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2023-11-29 03:22:30,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2023-11-29 03:22:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 03:22:30,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:30,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:30,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:22:30,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:30,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1724489562, now seen corresponding path program 1 times [2023-11-29 03:22:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361049860] [2023-11-29 03:22:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361049860] [2023-11-29 03:22:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361049860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:31,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:22:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873469496] [2023-11-29 03:22:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:22:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:22:31,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:31,220 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:31,399 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2023-11-29 03:22:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:22:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-29 03:22:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:31,401 INFO L225 Difference]: With dead ends: 60 [2023-11-29 03:22:31,401 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 03:22:31,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:31,402 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:31,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 163 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 03:22:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2023-11-29 03:22:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-29 03:22:31,409 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 16 [2023-11-29 03:22:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:31,409 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-29 03:22:31,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-29 03:22:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:22:31,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:31,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:31,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:22:31,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:31,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -622863686, now seen corresponding path program 1 times [2023-11-29 03:22:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579782769] [2023-11-29 03:22:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579782769] [2023-11-29 03:22:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579782769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298115154] [2023-11-29 03:22:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:32,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:32,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:32,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:22:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:32,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 03:22:32,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:32,536 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 [2023-11-29 03:22:32,543 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 [2023-11-29 03:22:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:22:32,570 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 19 treesize of output 18 [2023-11-29 03:22:32,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:32,621 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:22:32,632 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 30 treesize of output 21 [2023-11-29 03:22:32,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:32,664 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:22:32,673 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 30 treesize of output 21 [2023-11-29 03:22:32,868 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 30 treesize of output 21 [2023-11-29 03:22:32,883 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 30 treesize of output 21 [2023-11-29 03:22:32,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:32,921 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 03:22:32,932 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 30 treesize of output 21 [2023-11-29 03:22:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:33,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:33,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_355 Int)) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 v_ArrVal_355)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_356 (Array Int Int))) (or (not (= v_ArrVal_356 (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_356 .cse0)))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0))))) is different from false [2023-11-29 03:22:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:33,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298115154] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:22:33,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:22:33,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 24 [2023-11-29 03:22:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849594097] [2023-11-29 03:22:33,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:33,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:22:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:22:33,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2023-11-29 03:22:33,852 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:22:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:34,253 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-29 03:22:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:22:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2023-11-29 03:22:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:34,255 INFO L225 Difference]: With dead ends: 61 [2023-11-29 03:22:34,255 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 03:22:34,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=518, Unknown=1, NotChecked=46, Total=650 [2023-11-29 03:22:34,257 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:34,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 347 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 0 Unknown, 40 Unchecked, 0.3s Time] [2023-11-29 03:22:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 03:22:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-29 03:22:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-29 03:22:34,263 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 18 [2023-11-29 03:22:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:34,263 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-29 03:22:34,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 03:22:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-29 03:22:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:22:34,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:34,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:34,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:22:34,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:34,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:34,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -624299248, now seen corresponding path program 1 times [2023-11-29 03:22:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437195827] [2023-11-29 03:22:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437195827] [2023-11-29 03:22:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437195827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:34,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:22:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363774585] [2023-11-29 03:22:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:34,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:22:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:22:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:34,629 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:34,762 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2023-11-29 03:22:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:22:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-29 03:22:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:34,764 INFO L225 Difference]: With dead ends: 63 [2023-11-29 03:22:34,764 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 03:22:34,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:34,765 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:34,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 03:22:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2023-11-29 03:22:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-29 03:22:34,771 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 18 [2023-11-29 03:22:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:34,771 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-29 03:22:34,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-29 03:22:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:22:34,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:34,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:34,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:22:34,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:34,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1572939215, now seen corresponding path program 1 times [2023-11-29 03:22:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:34,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967950031] [2023-11-29 03:22:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:34,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967950031] [2023-11-29 03:22:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967950031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:22:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910987158] [2023-11-29 03:22:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:34,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:22:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:22:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:34,950 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:35,172 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2023-11-29 03:22:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:22:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 03:22:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:35,175 INFO L225 Difference]: With dead ends: 72 [2023-11-29 03:22:35,175 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 03:22:35,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:22:35,176 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:35,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 136 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 03:22:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2023-11-29 03:22:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-29 03:22:35,182 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 20 [2023-11-29 03:22:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:35,182 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-29 03:22:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-29 03:22:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:22:35,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:35,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:35,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:22:35,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:35,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1572939214, now seen corresponding path program 1 times [2023-11-29 03:22:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328719632] [2023-11-29 03:22:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328719632] [2023-11-29 03:22:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328719632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:22:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839224182] [2023-11-29 03:22:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:35,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:22:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:22:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:35,457 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:35,699 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-11-29 03:22:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:22:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 03:22:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:35,700 INFO L225 Difference]: With dead ends: 80 [2023-11-29 03:22:35,701 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 03:22:35,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:22:35,702 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:35,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 120 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 03:22:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2023-11-29 03:22:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2023-11-29 03:22:35,708 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 20 [2023-11-29 03:22:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:35,708 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2023-11-29 03:22:35,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2023-11-29 03:22:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:22:35,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:35,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:35,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:22:35,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:35,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash 918695024, now seen corresponding path program 1 times [2023-11-29 03:22:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172899411] [2023-11-29 03:22:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:35,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172899411] [2023-11-29 03:22:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172899411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330441913] [2023-11-29 03:22:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:35,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:35,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:22:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:36,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:22:36,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:36,164 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-11-29 03:22:36,208 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 03:22:36,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 03:22:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:36,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:22:36,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330441913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:36,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:22:36,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-29 03:22:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624404101] [2023-11-29 03:22:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:22:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:22:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2023-11-29 03:22:36,216 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:36,280 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-29 03:22:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:22:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-11-29 03:22:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:36,281 INFO L225 Difference]: With dead ends: 66 [2023-11-29 03:22:36,281 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 03:22:36,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2023-11-29 03:22:36,282 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:36,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 60 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2023-11-29 03:22:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 03:22:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-11-29 03:22:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-11-29 03:22:36,287 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 21 [2023-11-29 03:22:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:36,288 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-11-29 03:22:36,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-11-29 03:22:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:22:36,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:36,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:36,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:22:36,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:22:36,494 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:36,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 918695025, now seen corresponding path program 1 times [2023-11-29 03:22:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834372252] [2023-11-29 03:22:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834372252] [2023-11-29 03:22:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834372252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590618315] [2023-11-29 03:22:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:36,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:36,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:36,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:22:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:37,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:22:37,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:37,167 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-11-29 03:22:37,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:22:37,204 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 16 treesize of output 11 [2023-11-29 03:22:37,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:37,214 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 [2023-11-29 03:22:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:37,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:22:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590618315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:22:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2023-11-29 03:22:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732743312] [2023-11-29 03:22:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:37,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:22:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:22:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2023-11-29 03:22:37,232 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:37,360 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-11-29 03:22:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:22:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-11-29 03:22:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:37,362 INFO L225 Difference]: With dead ends: 78 [2023-11-29 03:22:37,362 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 03:22:37,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2023-11-29 03:22:37,363 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:37,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2023-11-29 03:22:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 03:22:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-11-29 03:22:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 67 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2023-11-29 03:22:37,368 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 21 [2023-11-29 03:22:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:37,368 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2023-11-29 03:22:37,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2023-11-29 03:22:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:22:37,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:37,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:37,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:22:37,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:37,576 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:37,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1516476840, now seen corresponding path program 1 times [2023-11-29 03:22:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184934537] [2023-11-29 03:22:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184934537] [2023-11-29 03:22:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184934537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:22:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554909779] [2023-11-29 03:22:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:37,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:22:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:22:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:37,726 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:37,888 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2023-11-29 03:22:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:22:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-29 03:22:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:37,889 INFO L225 Difference]: With dead ends: 81 [2023-11-29 03:22:37,889 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 03:22:37,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:22:37,890 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:37,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 194 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 03:22:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2023-11-29 03:22:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.56) internal successors, (78), 68 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-11-29 03:22:37,895 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 21 [2023-11-29 03:22:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:37,895 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-11-29 03:22:37,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-11-29 03:22:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:22:37,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:37,897 INFO L195 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] [2023-11-29 03:22:37,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:22:37,897 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:37,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 233939701, now seen corresponding path program 1 times [2023-11-29 03:22:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935018855] [2023-11-29 03:22:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935018855] [2023-11-29 03:22:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935018855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:38,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:22:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527118166] [2023-11-29 03:22:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:38,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:22:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:38,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:22:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:22:38,064 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:38,245 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2023-11-29 03:22:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:22:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-11-29 03:22:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:38,247 INFO L225 Difference]: With dead ends: 79 [2023-11-29 03:22:38,247 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 03:22:38,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:22:38,247 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:38,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 03:22:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-11-29 03:22:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 71 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2023-11-29 03:22:38,251 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 22 [2023-11-29 03:22:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:38,252 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2023-11-29 03:22:38,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2023-11-29 03:22:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:22:38,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:38,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:38,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:22:38,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:38,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1897252236, now seen corresponding path program 1 times [2023-11-29 03:22:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342371122] [2023-11-29 03:22:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342371122] [2023-11-29 03:22:38,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342371122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:38,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:38,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:22:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091134172] [2023-11-29 03:22:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:38,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:22:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:22:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:38,620 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:38,793 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-11-29 03:22:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:22:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-29 03:22:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:38,795 INFO L225 Difference]: With dead ends: 75 [2023-11-29 03:22:38,795 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 03:22:38,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:22:38,796 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:38,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 03:22:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 03:22:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 70 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2023-11-29 03:22:38,800 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 23 [2023-11-29 03:22:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:38,800 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2023-11-29 03:22:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2023-11-29 03:22:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:22:38,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:38,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:22:38,802 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:38,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1897252237, now seen corresponding path program 1 times [2023-11-29 03:22:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506379686] [2023-11-29 03:22:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:22:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506379686] [2023-11-29 03:22:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506379686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:22:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423067152] [2023-11-29 03:22:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:38,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:22:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:22:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:22:38,985 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:39,135 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-11-29 03:22:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:22:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-29 03:22:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:39,136 INFO L225 Difference]: With dead ends: 74 [2023-11-29 03:22:39,136 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 03:22:39,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:22:39,137 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:39,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 03:22:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 03:22:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.509433962264151) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2023-11-29 03:22:39,141 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 23 [2023-11-29 03:22:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:39,141 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2023-11-29 03:22:39,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2023-11-29 03:22:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:22:39,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:39,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:22:39,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:39,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2101791866, now seen corresponding path program 1 times [2023-11-29 03:22:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544199531] [2023-11-29 03:22:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544199531] [2023-11-29 03:22:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544199531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:39,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 03:22:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394087977] [2023-11-29 03:22:39,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:39,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:22:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:22:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:22:39,588 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:39,900 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-11-29 03:22:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:22:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-29 03:22:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:39,902 INFO L225 Difference]: With dead ends: 75 [2023-11-29 03:22:39,902 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 03:22:39,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:22:39,903 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:39,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 222 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 03:22:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-11-29 03:22:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.490566037735849) internal successors, (79), 69 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2023-11-29 03:22:39,906 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 25 [2023-11-29 03:22:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:39,907 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2023-11-29 03:22:39,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2023-11-29 03:22:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:22:39,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:39,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:39,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:22:39,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:39,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2101791867, now seen corresponding path program 1 times [2023-11-29 03:22:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192106562] [2023-11-29 03:22:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:40,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192106562] [2023-11-29 03:22:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192106562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283657911] [2023-11-29 03:22:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:40,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:40,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:22:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:40,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 03:22:40,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:40,894 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 [2023-11-29 03:22:40,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:40,952 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 [2023-11-29 03:22:40,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:22:40,971 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 [2023-11-29 03:22:41,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:41,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:22:41,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:22:41,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:22:41,050 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 [2023-11-29 03:22:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:41,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:22:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283657911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:22:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 18 [2023-11-29 03:22:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86865219] [2023-11-29 03:22:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:41,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:22:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:22:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:22:41,056 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:41,309 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-11-29 03:22:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:22:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-29 03:22:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:41,310 INFO L225 Difference]: With dead ends: 74 [2023-11-29 03:22:41,310 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 03:22:41,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:22:41,312 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:41,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 153 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 03:22:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 03:22:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.471698113207547) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-29 03:22:41,315 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 25 [2023-11-29 03:22:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:41,315 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-29 03:22:41,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-29 03:22:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:22:41,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:41,317 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:41,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:22:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:22:41,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:41,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1434147235, now seen corresponding path program 1 times [2023-11-29 03:22:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40849854] [2023-11-29 03:22:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40849854] [2023-11-29 03:22:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40849854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:41,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936509538] [2023-11-29 03:22:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:41,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:41,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:41,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:41,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:22:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:42,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 03:22:42,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:42,173 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 8 treesize of output 1 [2023-11-29 03:22:42,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:22:42,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:22:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:42,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:42,584 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 03:22:42,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2023-11-29 03:22:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936509538] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:22:42,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:22:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 27 [2023-11-29 03:22:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391499919] [2023-11-29 03:22:42,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 03:22:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 03:22:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:22:42,654 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:43,204 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-11-29 03:22:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:22:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 03:22:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:43,206 INFO L225 Difference]: With dead ends: 95 [2023-11-29 03:22:43,206 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 03:22:43,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 03:22:43,208 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 153 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 316 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:22:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 03:22:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2023-11-29 03:22:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 77 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-11-29 03:22:43,212 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 25 [2023-11-29 03:22:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:43,212 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-11-29 03:22:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:22:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-11-29 03:22:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:22:43,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:43,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:43,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:22:43,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:43,414 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:43,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1508892756, now seen corresponding path program 1 times [2023-11-29 03:22:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799442797] [2023-11-29 03:22:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799442797] [2023-11-29 03:22:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799442797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371889357] [2023-11-29 03:22:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:43,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:43,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:22:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:43,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:22:43,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:43,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 13 treesize of output 9 [2023-11-29 03:22:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:43,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:43,988 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_21|) 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_21| 0)))) is different from false [2023-11-29 03:22:43,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371889357] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:43,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:22:43,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-11-29 03:22:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122369161] [2023-11-29 03:22:43,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:43,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:22:43,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:22:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2023-11-29 03:22:43,992 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:44,235 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2023-11-29 03:22:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:22:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-11-29 03:22:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:44,236 INFO L225 Difference]: With dead ends: 88 [2023-11-29 03:22:44,236 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 03:22:44,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2023-11-29 03:22:44,237 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:44,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 178 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 03:22:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 03:22:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.537037037037037) internal successors, (83), 70 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2023-11-29 03:22:44,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 26 [2023-11-29 03:22:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:44,243 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2023-11-29 03:22:44,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:22:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2023-11-29 03:22:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:22:44,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:44,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:44,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:22:44,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:44,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:44,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1187439265, now seen corresponding path program 1 times [2023-11-29 03:22:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:44,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427591821] [2023-11-29 03:22:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427591821] [2023-11-29 03:22:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427591821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:45,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428323313] [2023-11-29 03:22:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:45,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:45,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:22:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:45,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 03:22:45,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:45,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:45,359 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 [2023-11-29 03:22:45,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:22:45,397 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 [2023-11-29 03:22:45,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:45,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2023-11-29 03:22:45,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-11-29 03:22:45,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:45,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2023-11-29 03:22:45,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-11-29 03:22:45,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-29 03:22:45,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 03:22:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:45,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:22:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428323313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:22:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2023-11-29 03:22:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810576534] [2023-11-29 03:22:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:45,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:22:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:22:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:22:45,585 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:45,856 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2023-11-29 03:22:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:22:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-29 03:22:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:45,857 INFO L225 Difference]: With dead ends: 76 [2023-11-29 03:22:45,857 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 03:22:45,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:22:45,858 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:45,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 177 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 03:22:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-11-29 03:22:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 70 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2023-11-29 03:22:45,861 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 27 [2023-11-29 03:22:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:45,861 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2023-11-29 03:22:45,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2023-11-29 03:22:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:22:45,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:45,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:45,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 03:22:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 03:22:46,063 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:46,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1187439264, now seen corresponding path program 1 times [2023-11-29 03:22:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001774710] [2023-11-29 03:22:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001774710] [2023-11-29 03:22:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001774710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:22:46,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:22:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 03:22:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239258191] [2023-11-29 03:22:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:22:46,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:22:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:22:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:22:46,447 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:46,713 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2023-11-29 03:22:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:22:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-29 03:22:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:46,714 INFO L225 Difference]: With dead ends: 75 [2023-11-29 03:22:46,714 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 03:22:46,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:22:46,714 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:46,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 230 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 03:22:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 03:22:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.5) internal successors, (81), 70 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-29 03:22:46,717 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2023-11-29 03:22:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:46,717 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-29 03:22:46,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-29 03:22:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 03:22:46,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:46,718 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:22:46,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:22:46,718 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:46,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash 432530249, now seen corresponding path program 1 times [2023-11-29 03:22:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389873669] [2023-11-29 03:22:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:22:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389873669] [2023-11-29 03:22:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389873669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003795642] [2023-11-29 03:22:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:46,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:46,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:22:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:47,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:22:47,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:22:47,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:47,089 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:22:47,089 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 [2023-11-29 03:22:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:22:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003795642] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:22:47,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:22:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-11-29 03:22:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412612625] [2023-11-29 03:22:47,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:47,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:22:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:22:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:22:47,105 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:47,203 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2023-11-29 03:22:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:22:47,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-29 03:22:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:47,205 INFO L225 Difference]: With dead ends: 82 [2023-11-29 03:22:47,205 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 03:22:47,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:22:47,205 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:47,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 121 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:22:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 03:22:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2023-11-29 03:22:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2023-11-29 03:22:47,208 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 33 [2023-11-29 03:22:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:47,208 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2023-11-29 03:22:47,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:22:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2023-11-29 03:22:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 03:22:47,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:47,209 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:22:47,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 03:22:47,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 03:22:47,410 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:47,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash 432530250, now seen corresponding path program 1 times [2023-11-29 03:22:47,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995086219] [2023-11-29 03:22:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:47,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995086219] [2023-11-29 03:22:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995086219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82018582] [2023-11-29 03:22:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:47,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:47,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:22:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:47,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:22:47,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:22:47,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:48,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:48,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 03:22:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 03:22:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82018582] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:22:48,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:22:48,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2023-11-29 03:22:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135386088] [2023-11-29 03:22:48,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:48,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:22:48,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:22:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:22:48,101 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 18 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:22:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:48,275 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2023-11-29 03:22:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:22:48,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-11-29 03:22:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:48,276 INFO L225 Difference]: With dead ends: 81 [2023-11-29 03:22:48,276 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 03:22:48,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:22:48,277 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:48,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:22:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 03:22:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-11-29 03:22:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-11-29 03:22:48,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 33 [2023-11-29 03:22:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:48,280 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-11-29 03:22:48,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 03:22:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-11-29 03:22:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 03:22:48,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:48,281 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:22:48,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:22:48,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:48,482 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:48,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash -950213974, now seen corresponding path program 1 times [2023-11-29 03:22:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100255235] [2023-11-29 03:22:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100255235] [2023-11-29 03:22:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100255235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942777904] [2023-11-29 03:22:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:49,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:49,609 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:49,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:22:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:49,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 03:22:49,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:49,960 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:49,960 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 [2023-11-29 03:22:49,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:22:50,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:50,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-29 03:22:50,122 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-29 03:22:50,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:50,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-11-29 03:22:50,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 31 treesize of output 13 [2023-11-29 03:22:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:50,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:50,331 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-29 03:22:50,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:22:50,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2896 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2896) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) |c_ULTIMATE.start_create_#t~mem12#1.base|)) is different from false [2023-11-29 03:22:50,394 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2895))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2896) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1)))) is different from false [2023-11-29 03:22:50,484 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2894))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2895)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2896) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1))))) is different from false [2023-11-29 03:22:50,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2894))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2895)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2896) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1))))) is different from false [2023-11-29 03:22:50,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:50,500 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 80 [2023-11-29 03:22:50,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:50,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6730 treesize of output 5835 [2023-11-29 03:22:50,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:50,605 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 533 treesize of output 477 [2023-11-29 03:22:50,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 469 treesize of output 425 [2023-11-29 03:22:50,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:50,631 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 425 treesize of output 289 [2023-11-29 03:22:51,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942777904] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:51,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:22:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2023-11-29 03:22:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743878487] [2023-11-29 03:22:51,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:51,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 03:22:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 03:22:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1256, Unknown=29, NotChecked=300, Total=1722 [2023-11-29 03:22:51,657 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:22:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:52,283 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-11-29 03:22:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:22:52,283 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2023-11-29 03:22:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:52,284 INFO L225 Difference]: With dead ends: 85 [2023-11-29 03:22:52,284 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 03:22:52,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=234, Invalid=1823, Unknown=29, NotChecked=364, Total=2450 [2023-11-29 03:22:52,286 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:52,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 480 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:22:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 03:22:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-11-29 03:22:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 77 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-11-29 03:22:52,289 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2023-11-29 03:22:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:52,290 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-11-29 03:22:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:22:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-11-29 03:22:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 03:22:52,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:52,291 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:22:52,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:22:52,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:52,491 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:52,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash -950213973, now seen corresponding path program 1 times [2023-11-29 03:22:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630319681] [2023-11-29 03:22:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630319681] [2023-11-29 03:22:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630319681] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799591533] [2023-11-29 03:22:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:53,787 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:53,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:22:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:54,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 03:22:54,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:54,116 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 [2023-11-29 03:22:54,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:54,188 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 [2023-11-29 03:22:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:22:54,230 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 [2023-11-29 03:22:54,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:22:54,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:22:54,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:22:54,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 30 treesize of output 13 [2023-11-29 03:22:54,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:54,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:22:54,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:22:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:22:54,578 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 [2023-11-29 03:22:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:54,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:54,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3134 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_3133 (Array Int Int)) (v_ArrVal_3134 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3133) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:22:54,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int)) (v_ArrVal_3134 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_3132))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_3131) .cse0 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3133) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3134 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_3131) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_3132) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2023-11-29 03:22:54,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3134 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3131) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3132) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int)) (v_ArrVal_3134 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3132))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3131) .cse3 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_3133) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:22:54,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int)) (v_ArrVal_3134 (Array Int Int)) (v_ArrVal_3129 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_3130))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse0 v_ArrVal_3132))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_3129) .cse0 v_ArrVal_3131) .cse1 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3133) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3134 (Array Int Int)) (v_ArrVal_3129 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_3130))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_3129) .cse6 v_ArrVal_3131) (select (select (store .cse7 .cse6 v_ArrVal_3132) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_3134))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))))) is different from false [2023-11-29 03:22:54,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int)) (v_ArrVal_3134 (Array Int Int)) (v_ArrVal_3129 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3130))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse1 v_ArrVal_3132))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3129) .cse1 v_ArrVal_3131) .cse2 v_ArrVal_3134) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3133) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3131 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3134 (Array Int Int)) (v_ArrVal_3129 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3130))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3129) .cse7 v_ArrVal_3131) (select (select (store .cse8 .cse7 v_ArrVal_3132) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_3134))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)))))) is different from false [2023-11-29 03:22:54,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:54,884 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2023-11-29 03:22:54,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:54,890 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2023-11-29 03:22:54,895 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 392 treesize of output 332 [2023-11-29 03:22:54,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:54,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 624 treesize of output 599 [2023-11-29 03:22:54,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 238 [2023-11-29 03:22:54,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 240 [2023-11-29 03:22:54,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2023-11-29 03:22:54,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198 [2023-11-29 03:22:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 174 [2023-11-29 03:22:55,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:55,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2023-11-29 03:22:55,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:55,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2023-11-29 03:22:55,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:22:55,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:22:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:22:55,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1042 treesize of output 664 [2023-11-29 03:22:55,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:22:55,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:22:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2023-11-29 03:22:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799591533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:55,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:22:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2023-11-29 03:22:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517148296] [2023-11-29 03:22:55,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 03:22:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:22:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 03:22:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1268, Unknown=31, NotChecked=380, Total=1806 [2023-11-29 03:22:55,242 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:22:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:55,962 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-11-29 03:22:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:22:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2023-11-29 03:22:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:55,963 INFO L225 Difference]: With dead ends: 84 [2023-11-29 03:22:55,963 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:22:55,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=2005, Unknown=35, NotChecked=480, Total=2756 [2023-11-29 03:22:55,965 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:55,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 437 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:22:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:22:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-11-29 03:22:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 77 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:22:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2023-11-29 03:22:55,967 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 35 [2023-11-29 03:22:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2023-11-29 03:22:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:22:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2023-11-29 03:22:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 03:22:55,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:55,968 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 03:22:55,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:22:56,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:56,169 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-11-29 03:22:56,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1672449483, now seen corresponding path program 2 times [2023-11-29 03:22:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:22:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961112053] [2023-11-29 03:22:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:22:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:22:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:22:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:22:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:22:57,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961112053] [2023-11-29 03:22:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961112053] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:57,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938656163] [2023-11-29 03:22:57,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:22:57,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:22:57,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:22:57,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:22:57,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f21bc8a-a5d6-43d0-bbc0-1c4df93fa393/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:22:58,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:22:58,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:22:58,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 03:22:58,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:58,527 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 [2023-11-29 03:22:58,530 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 [2023-11-29 03:22:58,537 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 19 treesize of output 18 [2023-11-29 03:22:58,545 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 19 treesize of output 18 [2023-11-29 03:22:58,592 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 30 treesize of output 21 [2023-11-29 03:22:58,598 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 30 treesize of output 21 [2023-11-29 03:22:58,611 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 30 treesize of output 21 [2023-11-29 03:22:58,619 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 30 treesize of output 21 [2023-11-29 03:22:58,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:22:58,679 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 [2023-11-29 03:22:58,747 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 38 treesize of output 29 [2023-11-29 03:22:58,754 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 34 treesize of output 36 [2023-11-29 03:22:58,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:22:58,917 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-29 03:22:58,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 75 [2023-11-29 03:22:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:22:58,937 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-29 03:22:58,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2023-11-29 03:22:59,195 INFO L349 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2023-11-29 03:22:59,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 149 treesize of output 110 [2023-11-29 03:22:59,221 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-29 03:22:59,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 91 [2023-11-29 03:22:59,415 INFO L349 Elim1Store]: treesize reduction 59, result has 18.1 percent of original size [2023-11-29 03:22:59,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 149 treesize of output 108 [2023-11-29 03:22:59,438 INFO L349 Elim1Store]: treesize reduction 45, result has 27.4 percent of original size [2023-11-29 03:22:59,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 89 [2023-11-29 03:22:59,944 INFO L349 Elim1Store]: treesize reduction 24, result has 73.0 percent of original size [2023-11-29 03:22:59,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 143 treesize of output 145 [2023-11-29 03:23:00,021 INFO L349 Elim1Store]: treesize reduction 24, result has 73.0 percent of original size [2023-11-29 03:23:00,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 79 treesize of output 115 [2023-11-29 03:23:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:00,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:23:00,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|))) (and (forall ((v_ArrVal_3386 (Array Int Int))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3386))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4)) 0) (not (= v_ArrVal_3385 (store .cse2 .cse3 (select v_ArrVal_3385 .cse3)))))) (not (= v_ArrVal_3386 (store .cse4 .cse3 (select v_ArrVal_3386 .cse3)))))) (forall ((v_ArrVal_3386 (Array Int Int))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3385))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) 0) (not (= v_ArrVal_3385 (store .cse2 .cse3 (select v_ArrVal_3385 .cse3)))))) (not (= v_ArrVal_3386 (store .cse4 .cse3 (select v_ArrVal_3386 .cse3)))))))) is different from false [2023-11-29 03:23:00,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse5 (select |c_#memory_$Pointer$#0.offset| .cse3)) (.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse1 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7) 20))) (and (forall ((v_ArrVal_3386 (Array Int Int))) (or (not (= v_ArrVal_3386 (store .cse0 .cse1 (select v_ArrVal_3386 .cse1)))) (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3385))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0) (not (= (store .cse5 .cse1 (select v_ArrVal_3385 .cse1)) v_ArrVal_3385)))))) (forall ((v_ArrVal_3386 (Array Int Int))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (not (= (store .cse5 .cse1 (select v_ArrVal_3385 .cse1)) v_ArrVal_3385)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3386))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0))) (not (= v_ArrVal_3386 (store .cse0 .cse1 (select v_ArrVal_3386 .cse1)))))))))) is different from false [2023-11-29 03:23:02,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| .cse9)) (.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$#0.base| .cse9)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (and (forall ((v_ArrVal_3384 (Array Int Int))) (or (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3383 .cse1)) v_ArrVal_3383)) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_3384)) (.cse5 (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_3383))) (let ((.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (or (not (= v_ArrVal_3386 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3386 .cse4)))) (forall ((v_ArrVal_3385 (Array Int Int))) (or (not (= (store (select .cse5 .cse3) .cse4 (select v_ArrVal_3385 .cse4)) v_ArrVal_3385)) (= (select (let ((.cse6 (store .cse2 .cse3 v_ArrVal_3386))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ 4 (select (select (store .cse5 .cse3 v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) 0))))))))) (not (= (store .cse10 .cse1 (select v_ArrVal_3384 .cse1)) v_ArrVal_3384)))) (forall ((v_ArrVal_3384 (Array Int Int))) (or (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3383 .cse1)) v_ArrVal_3383)) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse9 v_ArrVal_3383)) (.cse11 (store |c_#memory_$Pointer$#0.base| .cse9 v_ArrVal_3384))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse13 (+ (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20))) (or (not (= v_ArrVal_3386 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_3386 .cse13)))) (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3385))) (select (select .cse14 (select (select (store .cse11 .cse12 v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ 4 (select (select .cse14 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)))) 0) (not (= (store (select .cse15 .cse12) .cse13 (select v_ArrVal_3385 .cse13)) v_ArrVal_3385)))))))))) (not (= (store .cse10 .cse1 (select v_ArrVal_3384 .cse1)) v_ArrVal_3384)))))))) is different from false [2023-11-29 03:23:02,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse10 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse0 (select .cse11 .cse10)) (.cse12 (select .cse9 .cse10)) (.cse1 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3384 (Array Int Int))) (or (not (= v_ArrVal_3384 (store .cse0 .cse1 (select v_ArrVal_3384 .cse1)))) (forall ((v_ArrVal_3383 (Array Int Int))) (or (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse2 (store .cse11 .cse10 v_ArrVal_3384)) (.cse5 (store .cse9 .cse10 v_ArrVal_3383))) (let ((.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (or (not (= v_ArrVal_3386 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3386 .cse4)))) (forall ((v_ArrVal_3385 (Array Int Int))) (or (not (= (store (select .cse5 .cse3) .cse4 (select v_ArrVal_3385 .cse4)) v_ArrVal_3385)) (= (select (let ((.cse6 (store .cse2 .cse3 v_ArrVal_3386))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ (select (select (store .cse5 .cse3 v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4)) 0))))))) (not (= v_ArrVal_3383 (store .cse12 .cse1 (select v_ArrVal_3383 .cse1)))))))) (forall ((v_ArrVal_3384 (Array Int Int))) (or (not (= v_ArrVal_3384 (store .cse0 .cse1 (select v_ArrVal_3384 .cse1)))) (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= v_ArrVal_3383 (store .cse12 .cse1 (select v_ArrVal_3383 .cse1)))) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse13 (store .cse11 .cse10 v_ArrVal_3384)) (.cse16 (store .cse9 .cse10 v_ArrVal_3383))) (let ((.cse15 (+ (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (or (not (= v_ArrVal_3386 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_3386 .cse15)))) (forall ((v_ArrVal_3385 (Array Int Int))) (or (not (= (store (select .cse16 .cse14) .cse15 (select v_ArrVal_3385 .cse15)) v_ArrVal_3385)) (= (let ((.cse17 (store .cse16 .cse14 v_ArrVal_3385))) (select (select .cse17 (select (select (store .cse13 .cse14 v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ (select (select .cse17 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4))) 0)))))))))))))))) is different from false [2023-11-29 03:23:02,476 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse10))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse15 (select |c_#memory_$Pointer$#0.offset| .cse12)) (.cse13 (select |c_#memory_$Pointer$#0.base| .cse12)) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse10))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_28| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_28| .cse0) (forall ((v_ArrVal_3384 (Array Int Int))) (let ((.cse14 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_28|))) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse12 (store .cse15 .cse14 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse1 (store |c_#memory_$Pointer$#0.base| .cse12 (store .cse13 .cse14 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)) (.cse3 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10))) (or (not (= v_ArrVal_3384 (store (select .cse1 .cse2) .cse3 (select v_ArrVal_3384 .cse3)))) (forall ((v_ArrVal_3383 (Array Int Int))) (or (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse8 (store .cse11 .cse2 v_ArrVal_3383)) (.cse6 (store .cse1 .cse2 v_ArrVal_3384))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)) (.cse9 (+ 20 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (select (let ((.cse4 (store .cse6 .cse7 v_ArrVal_3386))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse8 .cse7 v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0) (not (= (store (select .cse8 .cse7) .cse9 (select v_ArrVal_3385 .cse9)) v_ArrVal_3385)))) (not (= v_ArrVal_3386 (store (select .cse6 .cse7) .cse9 (select v_ArrVal_3386 .cse9)))))))) (not (= v_ArrVal_3383 (store (select .cse11 .cse2) .cse3 (select v_ArrVal_3383 .cse3))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_28| Int)) (or (forall ((v_ArrVal_3384 (Array Int Int))) (let ((.cse25 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_28|))) (let ((.cse16 (store |c_#memory_$Pointer$#0.base| .cse12 (store .cse13 .cse25 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse19 (store |c_#memory_$Pointer$#0.offset| .cse12 (store .cse15 .cse25 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)) (.cse17 (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10))) (or (not (= v_ArrVal_3384 (store (select .cse16 .cse17) .cse18 (select v_ArrVal_3384 .cse18)))) (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= v_ArrVal_3383 (store (select .cse19 .cse17) .cse18 (select v_ArrVal_3383 .cse18)))) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse23 (store .cse19 .cse17 v_ArrVal_3383)) (.cse21 (store .cse16 .cse17 v_ArrVal_3384))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)) (.cse24 (+ 20 (select (select .cse23 |c_ULTIMATE.start_create_~now~0#1.base|) .cse10)))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (let ((.cse20 (store .cse23 .cse22 v_ArrVal_3385))) (select (select .cse20 (select (select (store .cse21 .cse22 v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse20 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0) (not (= (store (select .cse23 .cse22) .cse24 (select v_ArrVal_3385 .cse24)) v_ArrVal_3385)))) (not (= v_ArrVal_3386 (store (select .cse21 .cse22) .cse24 (select v_ArrVal_3386 .cse24))))))))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_28| .cse0))))))) is different from false [2023-11-29 03:23:02,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse14 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse12 (select .cse11 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse15 (select .cse14 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_28| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_28| |c_ULTIMATE.start_create_#t~ret8#1.offset|) (forall ((v_ArrVal_3384 (Array Int Int))) (let ((.cse13 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_28|))) (let ((.cse0 (store .cse14 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse15 .cse13 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse10 (store .cse11 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse12 .cse13 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (or (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= v_ArrVal_3383 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3383 .cse2)))) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse7 (store .cse0 .cse1 v_ArrVal_3383)) (.cse5 (store .cse10 .cse1 v_ArrVal_3384))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse8 (+ (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9) 20))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_3386))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store .cse7 .cse6 v_ArrVal_3385) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0) (not (= (store (select .cse7 .cse6) .cse8 (select v_ArrVal_3385 .cse8)) v_ArrVal_3385)))) (not (= v_ArrVal_3386 (store (select .cse5 .cse6) .cse8 (select v_ArrVal_3386 .cse8)))))))))) (not (= v_ArrVal_3384 (store (select .cse10 .cse1) .cse2 (select v_ArrVal_3384 .cse2))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_28| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_28| |c_ULTIMATE.start_create_#t~ret8#1.offset|) (forall ((v_ArrVal_3384 (Array Int Int))) (let ((.cse25 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_28|))) (let ((.cse16 (store .cse14 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse15 .cse25 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse24 (store .cse11 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse12 .cse25 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse17 (select (select .cse24 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (or (forall ((v_ArrVal_3383 (Array Int Int))) (or (not (= v_ArrVal_3383 (store (select .cse16 .cse17) .cse18 (select v_ArrVal_3383 .cse18)))) (forall ((v_ArrVal_3386 (Array Int Int))) (let ((.cse22 (store .cse16 .cse17 v_ArrVal_3383)) (.cse20 (store .cse24 .cse17 v_ArrVal_3384))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse23 (+ (select (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9) 20))) (or (forall ((v_ArrVal_3385 (Array Int Int))) (or (= (let ((.cse19 (store .cse22 .cse21 v_ArrVal_3385))) (select (select .cse19 (select (select (store .cse20 .cse21 v_ArrVal_3386) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse19 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0) (not (= (store (select .cse22 .cse21) .cse23 (select v_ArrVal_3385 .cse23)) v_ArrVal_3385)))) (not (= v_ArrVal_3386 (store (select .cse20 .cse21) .cse23 (select v_ArrVal_3386 .cse23)))))))))) (not (= v_ArrVal_3384 (store (select .cse24 .cse17) .cse18 (select v_ArrVal_3384 .cse18))))))))))))))) is different from false [2023-11-29 03:23:27,397 WARN L293 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 344 DAG size of output: 134 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:23:27,398 INFO L349 Elim1Store]: treesize reduction 756, result has 25.4 percent of original size [2023-11-29 03:23:27,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 1329385 treesize of output 884791 [2023-11-29 03:23:35,329 INFO L224 Elim1Store]: Index analysis took 108 ms [2023-11-29 03:28:02,195 WARN L293 SmtUtils]: Spent 4.45m on a formula simplification. DAG size of input: 404 DAG size of output: 152 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:28:02,195 INFO L349 Elim1Store]: treesize reduction 1712, result has 23.4 percent of original size [2023-11-29 03:28:02,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 280401763 treesize of output 277117026 [2023-11-29 03:28:12,073 WARN L293 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 15205 DAG size of output: 1586 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:28:39,072 WARN L293 SmtUtils]: Spent 20.98s on a formula simplification. DAG size of input: 391 DAG size of output: 139 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:28:39,072 INFO L349 Elim1Store]: treesize reduction 845, result has 25.0 percent of original size [2023-11-29 03:28:39,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 17 new quantified variables, introduced 79 case distinctions, treesize of input 98166 treesize of output 79320 [2023-11-29 03:29:23,161 WARN L293 SmtUtils]: Spent 40.01s on a formula simplification. DAG size of input: 298 DAG size of output: 294 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:29:23,161 INFO L349 Elim1Store]: treesize reduction 8, result has 98.9 percent of original size [2023-11-29 03:29:23,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 17 new quantified variables, introduced 66 case distinctions, treesize of input 97834 treesize of output 81142 [2023-11-29 03:29:27,716 INFO L224 Elim1Store]: Index analysis took 387 ms [2023-11-29 03:29:58,831 WARN L293 SmtUtils]: Spent 31.11s on a formula simplification. DAG size of input: 309 DAG size of output: 301 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:29:58,832 INFO L349 Elim1Store]: treesize reduction 33, result has 97.3 percent of original size [2023-11-29 03:29:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 80409 treesize of output 81408