./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-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_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91 --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:54:59,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:54:59,151 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-24 23:54:59,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:54:59,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:54:59,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:54:59,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:54:59,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:54:59,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:54:59,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:54:59,211 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:54:59,212 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:54:59,213 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:54:59,215 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:54:59,215 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:54:59,215 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:54:59,216 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:54:59,218 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:54:59,218 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:54:59,218 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:54:59,219 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:54:59,220 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:54:59,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 23:54:59,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 23:54:59,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:54:59,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:54:59,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:54:59,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 23:54:59,223 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 23:54:59,224 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 23:54:59,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:54:59,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 23:54:59,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:54:59,226 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:54:59,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:54:59,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:54:59,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:54:59,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:54:59,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:54:59,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:54:59,228 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:54:59,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:54:59,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:54:59,229 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:54:59,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:54:59,230 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/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_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91 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 -> Taipan 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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2023-11-24 23:54:59,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:54:59,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:54:59,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:54:59,565 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:54:59,566 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:54:59,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2023-11-24 23:55:02,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:55:02,961 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:55:02,961 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2023-11-24 23:55:02,988 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/data/9e4741a47/624ac6365644450798b1f8bcd16373c2/FLAGf1543198b [2023-11-24 23:55:03,002 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/data/9e4741a47/624ac6365644450798b1f8bcd16373c2 [2023-11-24 23:55:03,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:55:03,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:55:03,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:03,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:55:03,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:55:03,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdc696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03, skipping insertion in model container [2023-11-24 23:55:03,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:55:03,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:03,452 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:55:03,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:55:03,526 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:55:03,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03 WrapperNode [2023-11-24 23:55:03,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:55:03,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:03,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:55:03,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:55:03,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,574 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2023-11-24 23:55:03,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:55:03,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:55:03,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:55:03,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:55:03,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:55:03,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:55:03,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:55:03,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:55:03,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (1/1) ... [2023-11-24 23:55:03,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:55:03,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:03,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:55:03,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:55:03,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:55:03,685 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-24 23:55:03,685 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-24 23:55:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:55:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:55:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:55:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:55:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:55:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:55:03,837 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:55:03,840 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:55:04,193 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:55:04,266 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:55:04,266 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 23:55:04,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:04 BoogieIcfgContainer [2023-11-24 23:55:04,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:55:04,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:55:04,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:55:04,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:55:04,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:55:03" (1/3) ... [2023-11-24 23:55:04,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6304ffd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:04, skipping insertion in model container [2023-11-24 23:55:04,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:55:03" (2/3) ... [2023-11-24 23:55:04,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6304ffd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:55:04, skipping insertion in model container [2023-11-24 23:55:04,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:55:04" (3/3) ... [2023-11-24 23:55:04,278 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2023-11-24 23:55:04,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:55:04,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-24 23:55:04,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:55:04,360 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41287b30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:55:04,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-24 23:55:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 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-24 23:55:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 23:55:04,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:04,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 23:55:04,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:04,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 4451354, now seen corresponding path program 1 times [2023-11-24 23:55:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:04,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480060073] [2023-11-24 23:55:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:04,607 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-24 23:55:04,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480060073] [2023-11-24 23:55:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480060073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:04,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:55:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64608454] [2023-11-24 23:55:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:04,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:55:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:55:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:55:04,660 INFO L87 Difference]: Start difference. First operand has 53 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 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-24 23:55:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:04,791 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-11-24 23:55:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:55:04,794 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-24 23:55:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:04,802 INFO L225 Difference]: With dead ends: 52 [2023-11-24 23:55:04,803 INFO L226 Difference]: Without dead ends: 51 [2023-11-24 23:55:04,804 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-24 23:55:04,808 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:04,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-24 23:55:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-24 23:55:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 47 states have internal predecessors, (50), 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-24 23:55:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-11-24 23:55:04,851 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2023-11-24 23:55:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:04,852 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-11-24 23:55:04,852 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-24 23:55:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-11-24 23:55:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 23:55:04,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:04,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 23:55:04,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:55:04,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:04,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 4451355, now seen corresponding path program 1 times [2023-11-24 23:55:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151639012] [2023-11-24 23:55:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:05,038 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-24 23:55:05,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:05,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151639012] [2023-11-24 23:55:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151639012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:55:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060629666] [2023-11-24 23:55:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:05,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:55:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:05,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:55:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:55:05,043 INFO L87 Difference]: Start difference. First operand 51 states and 54 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-24 23:55:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:05,140 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-24 23:55:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:55:05,141 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-24 23:55:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:05,143 INFO L225 Difference]: With dead ends: 50 [2023-11-24 23:55:05,143 INFO L226 Difference]: Without dead ends: 50 [2023-11-24 23:55:05,144 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-24 23:55:05,145 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-24 23:55:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-24 23:55:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.130434782608696) internal successors, (49), 46 states have internal predecessors, (49), 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-24 23:55:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-11-24 23:55:05,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 4 [2023-11-24 23:55:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:05,155 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-11-24 23:55:05,156 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-24 23:55:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-11-24 23:55:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 23:55:05,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:05,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:55:05,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:05,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -530348794, now seen corresponding path program 1 times [2023-11-24 23:55:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436349397] [2023-11-24 23:55:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:05,344 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-24 23:55:05,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436349397] [2023-11-24 23:55:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436349397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:05,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:05,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:55:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941722125] [2023-11-24 23:55:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:55:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:55:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:55:05,352 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-24 23:55:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:05,503 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-11-24 23:55:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:55:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 7 [2023-11-24 23:55:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:05,508 INFO L225 Difference]: With dead ends: 49 [2023-11-24 23:55:05,512 INFO L226 Difference]: Without dead ends: 49 [2023-11-24 23:55:05,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:55:05,520 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:05,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-24 23:55:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-11-24 23:55:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 41 states have internal predecessors, (44), 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-24 23:55:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-11-24 23:55:05,534 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 7 [2023-11-24 23:55:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:05,534 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-11-24 23:55:05,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-24 23:55:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-11-24 23:55:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 23:55:05,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:05,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:05,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:55:05,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:05,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash -530348793, now seen corresponding path program 1 times [2023-11-24 23:55:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475086462] [2023-11-24 23:55:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:05,792 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-24 23:55:05,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475086462] [2023-11-24 23:55:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475086462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:55:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50434141] [2023-11-24 23:55:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:05,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:05,795 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-24 23:55:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:05,935 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-24 23:55:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 7 [2023-11-24 23:55:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:05,936 INFO L225 Difference]: With dead ends: 47 [2023-11-24 23:55:05,937 INFO L226 Difference]: Without dead ends: 47 [2023-11-24 23:55:05,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:05,938 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:05,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-24 23:55:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-11-24 23:55:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.826086956521739) internal successors, (42), 39 states have internal predecessors, (42), 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-24 23:55:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-11-24 23:55:05,944 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 7 [2023-11-24 23:55:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:05,945 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-11-24 23:55:05,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-24 23:55:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-11-24 23:55:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 23:55:05,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:05,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:05,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:55:05,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:05,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash -928522982, now seen corresponding path program 1 times [2023-11-24 23:55:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517778447] [2023-11-24 23:55:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:06,075 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-24 23:55:06,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517778447] [2023-11-24 23:55:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517778447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:06,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:55:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270043492] [2023-11-24 23:55:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:06,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:06,083 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-24 23:55:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:06,203 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2023-11-24 23:55:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2023-11-24 23:55:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:06,208 INFO L225 Difference]: With dead ends: 50 [2023-11-24 23:55:06,209 INFO L226 Difference]: Without dead ends: 50 [2023-11-24 23:55:06,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:06,210 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:06,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-24 23:55:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-11-24 23:55:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 44 states have internal predecessors, (50), 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-24 23:55:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-11-24 23:55:06,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 13 [2023-11-24 23:55:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:06,225 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-11-24 23:55:06,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-24 23:55:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-11-24 23:55:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 23:55:06,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:06,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:06,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:55:06,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:06,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -928522981, now seen corresponding path program 1 times [2023-11-24 23:55:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26047606] [2023-11-24 23:55:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:06,570 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-24 23:55:06,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26047606] [2023-11-24 23:55:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26047606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:06,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180325174] [2023-11-24 23:55:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:06,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:55:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:55:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:06,574 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-24 23:55:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:06,726 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-11-24 23:55:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:55:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 13 [2023-11-24 23:55:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:06,728 INFO L225 Difference]: With dead ends: 49 [2023-11-24 23:55:06,728 INFO L226 Difference]: Without dead ends: 49 [2023-11-24 23:55:06,729 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-24 23:55:06,732 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:06,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-24 23:55:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-24 23:55:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.75) internal successors, (49), 44 states have internal predecessors, (49), 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-24 23:55:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-11-24 23:55:06,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 13 [2023-11-24 23:55:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:06,750 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-11-24 23:55:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-24 23:55:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-11-24 23:55:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 23:55:06,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:06,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:55:06,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:06,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1280572993, now seen corresponding path program 1 times [2023-11-24 23:55:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914160973] [2023-11-24 23:55:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:06,878 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-24 23:55:06,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914160973] [2023-11-24 23:55:06,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914160973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:06,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:06,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 23:55:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874421562] [2023-11-24 23:55:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:55:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:55:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:06,883 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-24 23:55:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:06,969 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-24 23:55:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:55:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2023-11-24 23:55:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:06,971 INFO L225 Difference]: With dead ends: 52 [2023-11-24 23:55:06,971 INFO L226 Difference]: Without dead ends: 52 [2023-11-24 23:55:06,971 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-24 23:55:06,974 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:06,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-24 23:55:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-11-24 23:55:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 45 states have internal predecessors, (49), 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-24 23:55:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-24 23:55:06,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2023-11-24 23:55:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:06,986 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-24 23:55:06,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-24 23:55:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-24 23:55:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 23:55:06,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:06,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:55:06,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:06,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1092820800, now seen corresponding path program 1 times [2023-11-24 23:55:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497349634] [2023-11-24 23:55:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:07,434 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-24 23:55:07,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497349634] [2023-11-24 23:55:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497349634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100029923] [2023-11-24 23:55:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:07,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:07,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:55:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:07,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-24 23:55:07,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:07,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:55:07,811 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-24 23:55:07,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:55:07,849 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-24 23:55:07,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:55:07,863 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-24 23:55:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:55:07,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100029923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [204453977] [2023-11-24 23:55:08,115 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-24 23:55:08,115 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:08,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:55:08,127 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:55:08,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:55:08,971 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 114 for LOIs [2023-11-24 23:55:09,122 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:55:19,378 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '850#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_~now~0#1.offset| 0) (or (and (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_int_49| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_49| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_create_#t~ret8#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 4))))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483648)) (<= (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_old(#memory_int)_AFTER_CALL_6|) (= (store |v_#memory_int_50| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_int_51|) (= |v_#memory_int_50| (store |v_#memory_int_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_create_~sll~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_create_~sll~0#1.base|) 4)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483647))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_68| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)))) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6|) (= (store (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.offset_66|))) (exists ((|v_#valid_71| (Array Int Int))) (= 0 (select |v_#valid_71| |ULTIMATE.start_create_~sll~0#1.base|))) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_8| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_#memory_$Pointer$.base_BEFORE_CALL_8|) (= (store (store |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.base_66|))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_73| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (exists ((|v_#length_62| (Array Int Int))) (= (store |v_#length_62| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0))))) (and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483648)) (<= (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483647) (= (store |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_old(#memory_int)_AFTER_CALL_5|) (<= 0 (+ (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483648)) (= |v_#memory_int_50| (store |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_create_~sll~0#1.base|) 4)))) (= (store |v_#memory_int_50| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_int_51| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_int_51|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483647))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 12)))) (= (store (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_66| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.base_66|))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_71| (Array Int Int))) (and (= (select |v_#valid_71| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= |#valid| (store |v_#valid_71| |ULTIMATE.start_create_#t~ret8#1.base| 1)))) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_64| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)) |#memory_$Pointer$.base|)) (exists ((|v_#length_60| (Array Int Int))) (= |#length| (store |v_#length_60| |ULTIMATE.start_create_#t~ret8#1.base| 16))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)))) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (store |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 12)))) (= |v_#memory_$Pointer$.offset_66| (store (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_66| |ULTIMATE.start_create_~now~0#1.base|) 0)))))) (exists ((|v_#memory_int_52| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_create_#t~ret8#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 4))))) (exists ((|v_#valid_72| (Array Int Int))) (= (select |v_#valid_72| |ULTIMATE.start_create_~sll~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0)))))) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0) (<= (select |#length| |ULTIMATE.start_create_~now~0#1.base|) 11))' at error location [2023-11-24 23:55:19,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:55:19,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:55:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-11-24 23:55:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981667386] [2023-11-24 23:55:19,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:19,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 23:55:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 23:55:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=742, Unknown=5, NotChecked=56, Total=930 [2023-11-24 23:55:19,382 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:55:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:19,829 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2023-11-24 23:55:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:55:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-11-24 23:55:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:19,830 INFO L225 Difference]: With dead ends: 61 [2023-11-24 23:55:19,830 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:55:19,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=145, Invalid=846, Unknown=5, NotChecked=60, Total=1056 [2023-11-24 23:55:19,832 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:19,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2023-11-24 23:55:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:55:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-11-24 23:55:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 51 states have internal predecessors, (60), 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-24 23:55:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2023-11-24 23:55:19,843 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 15 [2023-11-24 23:55:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:19,845 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2023-11-24 23:55:19,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:55:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2023-11-24 23:55:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 23:55:19,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:19,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:19,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:20,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:20,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1092820799, now seen corresponding path program 1 times [2023-11-24 23:55:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:20,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659232465] [2023-11-24 23:55:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:20,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659232465] [2023-11-24 23:55:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659232465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000691104] [2023-11-24 23:55:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:20,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:20,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:55:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:20,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-24 23:55:20,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:55:20,354 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-24 23:55:20,378 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:55:20,378 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-24 23:55:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:55:20,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000691104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1647987595] [2023-11-24 23:55:20,433 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-24 23:55:20,433 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:20,433 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:55:20,433 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:55:20,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:55:20,843 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 110 for LOIs [2023-11-24 23:55:20,916 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:55:29,335 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1041#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_#valid_84| (Array Int Int))) (and (= (store |v_#valid_84| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|) (= (select |v_#valid_84| |ULTIMATE.start_create_#t~ret8#1.base|) 0))) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_11| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int))) (|v_#memory_int_61| (Array Int (Array Int Int)))) (and (<= (select (select |v_old(#memory_int)_AFTER_CALL_11| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483647) (= |v_old(#memory_int)_AFTER_CALL_11| (store |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_int)_AFTER_CALL_11| |ULTIMATE.start_create_~now~0#1.base|) 12)))) (<= (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_11| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483648)) (<= 0 (+ (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_59| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_create_~sll~0#1.base|) 4 (select (select |v_#memory_int_60| |ULTIMATE.start_create_~sll~0#1.base|) 4))) |v_#memory_int_60|) (= |v_#memory_int_61| (store |v_#memory_int_60| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0)))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_13| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet7#1_13| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_13| 0)))) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)))) (exists ((|v_#valid_83| (Array Int Int))) (= (select |v_#valid_83| |ULTIMATE.start_create_~sll~0#1.base|) 0)) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_77| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)) |#memory_$Pointer$.base|)) (exists ((|v_#length_69| (Array Int Int))) (= (store |v_#length_69| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.offset_76|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| (store |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| |ULTIMATE.start_create_~now~0#1.base|) 12)))))) (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.base_76|) (= (store |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_11| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_11|))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_62| (Array Int (Array Int Int)))) (= (store |v_#memory_int_62| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_create_#t~ret8#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 4))) |#memory_int|))) (and (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_13| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet7#1_13| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_13| 0)))) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_83| (Array Int Int))) (= (select |v_#valid_83| |ULTIMATE.start_create_~sll~0#1.base|) 0)) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int))) (|v_#memory_int_61| (Array Int (Array Int Int)))) (and (<= (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0) 2147483648)) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483648)) (= (store |v_#memory_int_59| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_create_~sll~0#1.base|) 4 (select (select |v_#memory_int_60| |ULTIMATE.start_create_~sll~0#1.base|) 4))) |v_#memory_int_60|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 12) 2147483647) (= |v_#memory_int_61| (store |v_#memory_int_60| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_61| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_int)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 12)))))) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#t~ret8#1.base|) 4 0)))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_12| (store |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 12)))) (= (store (store |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_76| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.offset_76|))) (exists ((|v_#memory_int_63| (Array Int (Array Int Int)))) (= (store |v_#memory_int_63| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_create_#t~ret8#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 4))) |#memory_int|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base| (store (select (store |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_74| |ULTIMATE.start_create_~sll~0#1.base|) 4 0)) |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_$Pointer$.base_76|) (= (store |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_76| |ULTIMATE.start_create_~now~0#1.base|) 12 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 12))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_12|))) (exists ((|v_#valid_85| (Array Int Int))) (and (= (store |v_#valid_85| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|) (= (select |v_#valid_85| |ULTIMATE.start_create_#t~ret8#1.base|) 0))) (exists ((|v_#length_70| (Array Int Int))) (= (store |v_#length_70| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)))) (= |ULTIMATE.start_create_~now~0#1.offset| 0) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_create_~now~0#1.base|) 1)))' at error location [2023-11-24 23:55:29,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:55:29,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:55:29,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-24 23:55:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781418388] [2023-11-24 23:55:29,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:29,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 23:55:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 23:55:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2023-11-24 23:55:29,337 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 10 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:55:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:29,618 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-11-24 23:55:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:55:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2023-11-24 23:55:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:29,620 INFO L225 Difference]: With dead ends: 56 [2023-11-24 23:55:29,620 INFO L226 Difference]: Without dead ends: 56 [2023-11-24 23:55:29,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=80, Invalid=428, Unknown=2, NotChecked=42, Total=552 [2023-11-24 23:55:29,621 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:29,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2023-11-24 23:55:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-24 23:55:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-24 23:55:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 51 states have internal predecessors, (59), 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-24 23:55:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2023-11-24 23:55:29,626 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 15 [2023-11-24 23:55:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:29,626 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2023-11-24 23:55:29,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:55:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2023-11-24 23:55:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 23:55:29,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:29,627 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:29,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:29,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:29,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:29,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1042665444, now seen corresponding path program 1 times [2023-11-24 23:55:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170493730] [2023-11-24 23:55:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:30,305 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-24 23:55:30,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170493730] [2023-11-24 23:55:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170493730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494529427] [2023-11-24 23:55:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:30,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:30,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:30,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:30,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:55:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:30,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-24 23:55:30,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:30,409 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-24 23:55:30,413 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-24 23:55:30,480 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 23 treesize of output 11 [2023-11-24 23:55:30,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 23 treesize of output 11 [2023-11-24 23:55:30,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 23:55:30,514 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 23 treesize of output 11 [2023-11-24 23:55:30,555 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-24 23:55:30,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:30,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse0 (+ 12 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_248 (Array Int Int))) (or (not (= v_ArrVal_248 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_248 .cse0)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_249 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 0) (not (= v_ArrVal_249 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_249 .cse0)))))))) is different from false [2023-11-24 23:55:31,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-24 23:55:31,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:55:31,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-24 23:55:31,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:55:31,058 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:55:31,078 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-24 23:55:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494529427] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [239298080] [2023-11-24 23:55:31,082 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-24 23:55:31,082 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:31,082 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:55:31,082 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:55:31,083 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:55:31,556 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-11-24 23:55:31,565 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:55:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [239298080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:34,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:34,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 10, 10] total 28 [2023-11-24 23:55:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400840952] [2023-11-24 23:55:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:34,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-24 23:55:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:34,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-24 23:55:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=608, Unknown=1, NotChecked=50, Total=756 [2023-11-24 23:55:34,035 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-24 23:55:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:35,175 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-11-24 23:55:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 23:55:35,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 [2023-11-24 23:55:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:35,176 INFO L225 Difference]: With dead ends: 61 [2023-11-24 23:55:35,176 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:55:35,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=97, Invalid=608, Unknown=1, NotChecked=50, Total=756 [2023-11-24 23:55:35,178 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:35,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-24 23:55:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:55:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-24 23:55:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 54 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-11-24 23:55:35,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 15 [2023-11-24 23:55:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:35,183 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-11-24 23:55:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-24 23:55:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-11-24 23:55:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:55:35,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:35,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:35,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:35,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 23:55:35,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:35,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2037095241, now seen corresponding path program 1 times [2023-11-24 23:55:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215913810] [2023-11-24 23:55:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:35,478 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-24 23:55:35,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215913810] [2023-11-24 23:55:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215913810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:35,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 23:55:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331742654] [2023-11-24 23:55:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 23:55:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:35,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 23:55:35,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:55:35,480 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-24 23:55:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:35,622 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-11-24 23:55:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:55:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-24 23:55:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:35,623 INFO L225 Difference]: With dead ends: 69 [2023-11-24 23:55:35,623 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 23:55:35,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-24 23:55:35,624 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:35,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 134 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 23:55:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2023-11-24 23:55:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.641025641025641) internal successors, (64), 55 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-11-24 23:55:35,628 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 16 [2023-11-24 23:55:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:35,629 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-11-24 23:55:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-24 23:55:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-11-24 23:55:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:55:35,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:35,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:35,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:55:35,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:35,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2037096557, now seen corresponding path program 1 times [2023-11-24 23:55:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601350816] [2023-11-24 23:55:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:35,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601350816] [2023-11-24 23:55:35,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601350816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122719971] [2023-11-24 23:55:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:35,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:35,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:35,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:35,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:55:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:35,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 23:55:35,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:35,847 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-24 23:55:35,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:55:35,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122719971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:35,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:55:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2023-11-24 23:55:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258946072] [2023-11-24 23:55:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:35,850 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 5 states have (on average 2.8) 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-24 23:55:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:36,005 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-24 23:55:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:55:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) 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-24 23:55:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:36,006 INFO L225 Difference]: With dead ends: 81 [2023-11-24 23:55:36,006 INFO L226 Difference]: Without dead ends: 81 [2023-11-24 23:55:36,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:55:36,007 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:36,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 83 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-24 23:55:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2023-11-24 23:55:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 62 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2023-11-24 23:55:36,029 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 16 [2023-11-24 23:55:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:36,029 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2023-11-24 23:55:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) 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-24 23:55:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2023-11-24 23:55:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:55:36,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:36,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:36,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-24 23:55:36,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 23:55:36,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:36,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2037096556, now seen corresponding path program 1 times [2023-11-24 23:55:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347646910] [2023-11-24 23:55:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:36,472 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-24 23:55:36,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347646910] [2023-11-24 23:55:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347646910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:36,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 23:55:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582194652] [2023-11-24 23:55:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:36,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 23:55:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 23:55:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:55:36,475 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-24 23:55:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:36,697 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-24 23:55:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:55:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-24 23:55:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:36,699 INFO L225 Difference]: With dead ends: 85 [2023-11-24 23:55:36,699 INFO L226 Difference]: Without dead ends: 85 [2023-11-24 23:55:36,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-24 23:55:36,700 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:36,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:55:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-24 23:55:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2023-11-24 23:55:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.58) internal successors, (79), 65 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2023-11-24 23:55:36,706 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 16 [2023-11-24 23:55:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:36,706 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2023-11-24 23:55:36,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-24 23:55:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2023-11-24 23:55:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:55:36,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:36,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:36,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 23:55:36,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:36,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2066117182, now seen corresponding path program 1 times [2023-11-24 23:55:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047457040] [2023-11-24 23:55:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:55:36,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047457040] [2023-11-24 23:55:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047457040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:55:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464218880] [2023-11-24 23:55:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:36,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:36,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:36,824 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-24 23:55:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:36,954 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2023-11-24 23:55:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:36,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17 [2023-11-24 23:55:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:36,955 INFO L225 Difference]: With dead ends: 70 [2023-11-24 23:55:36,955 INFO L226 Difference]: Without dead ends: 70 [2023-11-24 23:55:36,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:36,956 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:36,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-24 23:55:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-24 23:55:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.54) internal successors, (77), 64 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-11-24 23:55:36,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 17 [2023-11-24 23:55:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:36,960 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-11-24 23:55:36,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-24 23:55:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-11-24 23:55:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:55:36,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:36,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:36,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:55:36,962 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:36,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2066117181, now seen corresponding path program 1 times [2023-11-24 23:55:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:36,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484845548] [2023-11-24 23:55:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:55:37,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484845548] [2023-11-24 23:55:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484845548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:37,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:55:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022925422] [2023-11-24 23:55:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:37,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:55:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:55:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:55:37,224 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-24 23:55:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:37,391 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-11-24 23:55:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:55:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2023-11-24 23:55:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:37,392 INFO L225 Difference]: With dead ends: 69 [2023-11-24 23:55:37,392 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 23:55:37,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:55:37,393 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:37,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 23:55:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-24 23:55:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.5) internal successors, (75), 63 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-11-24 23:55:37,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 17 [2023-11-24 23:55:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:37,398 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-11-24 23:55:37,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-24 23:55:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-11-24 23:55:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:55:37,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:37,399 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-24 23:55:37,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 23:55:37,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:37,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 855324623, now seen corresponding path program 1 times [2023-11-24 23:55:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368397395] [2023-11-24 23:55:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:37,534 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-24 23:55:37,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:37,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368397395] [2023-11-24 23:55:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368397395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:37,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 23:55:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143358185] [2023-11-24 23:55:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:37,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 23:55:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 23:55:37,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:55:37,536 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-24 23:55:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:37,696 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2023-11-24 23:55:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:55:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-24 23:55:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:37,697 INFO L225 Difference]: With dead ends: 75 [2023-11-24 23:55:37,697 INFO L226 Difference]: Without dead ends: 75 [2023-11-24 23:55:37,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-24 23:55:37,698 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:37,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:55:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-24 23:55:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2023-11-24 23:55:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:55:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-11-24 23:55:37,702 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 18 [2023-11-24 23:55:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:37,702 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-11-24 23:55:37,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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-24 23:55:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-11-24 23:55:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:55:37,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:37,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:37,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 23:55:37,704 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-11-24 23:55:37,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1263640471, now seen corresponding path program 1 times [2023-11-24 23:55:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004574894] [2023-11-24 23:55:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:38,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004574894] [2023-11-24 23:55:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004574894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522819447] [2023-11-24 23:55:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:38,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:38,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:38,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:38,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eb915d-a18f-44e2-a6b2-0d128afc7c24/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:55:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:38,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-24 23:55:38,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:38,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:55:38,372 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-24 23:55:38,391 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:55:38,391 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-24 23:55:38,403 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-24 23:55:38,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 23:55:38,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 23:55:38,468 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-24 23:55:38,478 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-24 23:55:38,493 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-24 23:55:38,500 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-24 23:55:38,501 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-24 23:55:38,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:38,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_506 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_506) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_506) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_505) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))))) is different from false [2023-11-24 23:55:38,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_506 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_506) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_506) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_505) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))) is different from false [2023-11-24 23:55:38,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:38,596 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 45 treesize of output 46 [2023-11-24 23:55:38,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:38,603 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 35 treesize of output 36 [2023-11-24 23:55:38,609 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 62 treesize of output 50 [2023-11-24 23:55:38,613 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 96 treesize of output 78 [2023-11-24 23:55:38,627 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 15 treesize of output 11 [2023-11-24 23:55:38,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:55:38,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:38,639 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 24 treesize of output 25 [2023-11-24 23:55:38,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:55:38,646 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 22 treesize of output 10 [2023-11-24 23:55:39,070 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-24 23:55:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522819447] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2061127966] [2023-11-24 23:55:39,072 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-24 23:55:39,073 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:55:39,073 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:55:39,073 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:55:39,073 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:55:40,179 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 112 for LOIs [2023-11-24 23:55:40,250 INFO L180 IcfgInterpreter]: Interpretation finished