./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:16:28,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:16:28,569 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:16:28,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:16:28,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:16:28,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:16:28,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:16:28,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:16:28,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:16:28,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:16:28,606 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:16:28,606 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:16:28,607 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:16:28,607 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:16:28,608 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:16:28,609 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:16:28,609 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:16:28,610 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:16:28,610 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:16:28,611 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:16:28,611 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:16:28,612 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:16:28,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:16:28,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:16:28,614 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:16:28,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:16:28,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:16:28,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:16:28,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:16:28,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:16:28,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:16:28,617 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:16:28,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:16:28,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:16:28,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:16:28,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:16:28,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:16:28,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:16:28,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:16:28,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:16:28,621 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:16:28,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:16:28,622 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:16:28,622 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:16:28,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:16:28,623 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_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/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_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2023-11-19 05:16:28,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:16:28,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:16:28,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:16:28,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:16:28,896 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:16:28,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-19 05:16:32,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:16:32,423 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:16:32,424 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-19 05:16:32,441 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/data/21bbfd9c0/97d2ca10162049d4a6e2e009a66f579d/FLAG1d03c9338 [2023-11-19 05:16:32,455 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/data/21bbfd9c0/97d2ca10162049d4a6e2e009a66f579d [2023-11-19 05:16:32,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:16:32,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:16:32,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:16:32,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:16:32,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:16:32,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:32,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e05a0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32, skipping insertion in model container [2023-11-19 05:16:32,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:32,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:16:32,877 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-19 05:16:32,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:16:32,898 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:16:32,948 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-19 05:16:32,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:16:32,990 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:16:32,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32 WrapperNode [2023-11-19 05:16:32,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:16:32,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:16:32,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:16:32,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:16:33,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,055 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2023-11-19 05:16:33,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:16:33,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:16:33,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:16:33,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:16:33,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:16:33,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:16:33,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:16:33,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:16:33,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (1/1) ... [2023-11-19 05:16:33,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:16:33,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:33,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:16:33,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:16:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:16:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:16:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:16:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:16:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:16:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:16:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:16:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:16:33,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:16:33,372 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:16:33,380 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:16:33,680 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:16:33,768 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:16:33,768 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 05:16:33,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:16:33 BoogieIcfgContainer [2023-11-19 05:16:33,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:16:33,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:16:33,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:16:33,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:16:33,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:16:32" (1/3) ... [2023-11-19 05:16:33,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57176962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:16:33, skipping insertion in model container [2023-11-19 05:16:33,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:32" (2/3) ... [2023-11-19 05:16:33,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57176962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:16:33, skipping insertion in model container [2023-11-19 05:16:33,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:16:33" (3/3) ... [2023-11-19 05:16:33,793 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-11-19 05:16:33,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:16:33,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:16:33,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:16:33,866 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@580f086d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:16:33,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:16:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:16:33,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:33,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:16:33,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:33,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1698198648, now seen corresponding path program 1 times [2023-11-19 05:16:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376629212] [2023-11-19 05:16:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:34,141 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-19 05:16:34,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376629212] [2023-11-19 05:16:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376629212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:16:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55062503] [2023-11-19 05:16:34,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:16:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:16:34,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:16:34,183 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:34,220 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-19 05:16:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:16:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 05:16:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:34,231 INFO L225 Difference]: With dead ends: 15 [2023-11-19 05:16:34,231 INFO L226 Difference]: Without dead ends: 8 [2023-11-19 05:16:34,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:16:34,239 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:34,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-19 05:16:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-19 05:16:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-19 05:16:34,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-11-19 05:16:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:34,274 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-19 05:16:34,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-19 05:16:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 05:16:34,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:34,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:34,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:16:34,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:34,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1518656950, now seen corresponding path program 1 times [2023-11-19 05:16:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342716291] [2023-11-19 05:16:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:35,444 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-19 05:16:35,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342716291] [2023-11-19 05:16:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342716291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388467545] [2023-11-19 05:16:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:16:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:16:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:16:35,453 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:35,613 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-19 05:16:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:16:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 05:16:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:35,618 INFO L225 Difference]: With dead ends: 15 [2023-11-19 05:16:35,618 INFO L226 Difference]: Without dead ends: 13 [2023-11-19 05:16:35,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:16:35,620 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-19 05:16:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-19 05:16:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-19 05:16:35,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-11-19 05:16:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:35,634 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-19 05:16:35,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-19 05:16:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:16:35,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:35,637 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:16:35,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:35,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2058731945, now seen corresponding path program 1 times [2023-11-19 05:16:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291082030] [2023-11-19 05:16:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:37,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291082030] [2023-11-19 05:16:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291082030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278489782] [2023-11-19 05:16:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:37,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:37,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:37,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:16:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:37,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-19 05:16:37,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:37,291 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 0 case distinctions, treesize of input 43 treesize of output 34 [2023-11-19 05:16:37,373 INFO L349 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2023-11-19 05:16:37,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2023-11-19 05:16:37,411 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 18 treesize of output 7 [2023-11-19 05:16:37,450 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:16:37,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:16:37,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-19 05:16:37,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2023-11-19 05:16:37,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:37,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-19 05:16:37,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,003 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-19 05:16:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-11-19 05:16:38,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-19 05:16:38,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,077 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 22 treesize of output 11 [2023-11-19 05:16:38,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2023-11-19 05:16:38,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:38,131 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 22 treesize of output 11 [2023-11-19 05:16:38,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:16:38,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 96 [2023-11-19 05:16:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:38,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:16:39,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:16:39,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 39 [2023-11-19 05:16:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:40,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278489782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:16:40,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2113819076] [2023-11-19 05:16:40,553 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-19 05:16:40,553 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:16:40,557 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:16:40,562 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:16:40,562 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:16:48,631 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:16:50,532 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse1 (select |v_#memory_int_79| .cse0)) (.cse2 (select (select |v_#memory_$Pointer$.offset_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse3 (select .cse1 .cse2))) (and (= (store |v_#memory_int_79| .cse0 (store .cse1 .cse2 (+ .cse3 (* (- 1) (select (select |v_#memory_int_79| |c_ULTIMATE.start_main_~head~0#1.base|) 0))))) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| .cse0 (store (select |v_#memory_$Pointer$.base_73| .cse0) .cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| .cse0 (store (select |v_#memory_$Pointer$.offset_73| .cse0) .cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)))) (<= 101 .cse3)))))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse7 (select |v_#memory_int_79| .cse4)) (.cse5 (select (select |v_#memory_$Pointer$.offset_73| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse6 (select .cse7 .cse5))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| .cse4 (store (select |v_#memory_$Pointer$.base_73| .cse4) .cse5 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)))) (<= .cse6 100) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| .cse4 (store (select |v_#memory_$Pointer$.offset_73| .cse4) .cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)))) (= |c_#memory_int| (store |v_#memory_int_79| .cse4 (store .cse7 .cse5 (+ .cse6 (select (select |v_#memory_int_79| |c_ULTIMATE.start_main_~head~0#1.base|) 0))))))))))) (<= 1 |c_#StackHeapBarrier|) (= .cse8 |c_ULTIMATE.start_main_#t~mem17#1|) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (let ((.cse9 (not |v_ULTIMATE.start_main_#t~short19#1_20|))) (and (or (and (<= |c_ULTIMATE.start_main_#t~mem17#1| 90) .cse9) (and |v_ULTIMATE.start_main_#t~short19#1_20| (<= 91 |c_ULTIMATE.start_main_#t~mem17#1|))) (let ((.cse10 (not |c_ULTIMATE.start_main_#t~short19#1|))) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_19| |c_ULTIMATE.start_main_#t~mem18#1|) .cse9 .cse10) (and |v_ULTIMATE.start_main_#t~short19#1_20| (= |c_ULTIMATE.start_main_#t~mem18#1| .cse8) (or (and |c_ULTIMATE.start_main_#t~short19#1| (<= |c_ULTIMATE.start_main_#t~mem18#1| 109)) (and .cse10 (<= 110 |c_ULTIMATE.start_main_#t~mem18#1|))))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from true [2023-11-19 05:16:50,535 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '145#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1_20| Int) (|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (and (or |v_ULTIMATE.start_main_#t~short19#1_20| (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0) 91)) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| |v_ULTIMATE.start_main_#t~mem18#1_19|) (not |v_ULTIMATE.start_main_#t~short19#1_20|)) (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_20|))))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.offset|) (or (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (<= 101 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))) (= |#memory_int| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (* (- 1) (select (select |v_#memory_int_79| |ULTIMATE.start_main_~head~0#1.base|) 0)) (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))))) (= (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))) |#memory_$Pointer$.base|))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (= |#memory_int| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (select (select |v_#memory_int_79| |ULTIMATE.start_main_~head~0#1.base|) 0) (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))))) (<= (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) 100) (= (store |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_73| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_main_~head~0#1.base|) 4)))) |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~m~0#1.offset| 0))' at error location [2023-11-19 05:16:50,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:16:50,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:16:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-19 05:16:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222343696] [2023-11-19 05:16:50,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:16:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:16:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:16:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=224, Unknown=2, NotChecked=30, Total=306 [2023-11-19 05:16:50,539 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:54,123 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-19 05:16:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:16:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:16:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:54,125 INFO L225 Difference]: With dead ends: 17 [2023-11-19 05:16:54,125 INFO L226 Difference]: Without dead ends: 15 [2023-11-19 05:16:54,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=72, Invalid=271, Unknown=3, NotChecked=34, Total=380 [2023-11-19 05:16:54,128 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:54,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 05:16:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-19 05:16:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2023-11-19 05:16:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-19 05:16:54,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2023-11-19 05:16:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:54,134 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-19 05:16:54,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:16:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-19 05:16:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:16:54,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:54,135 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:54,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:54,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 859689689, now seen corresponding path program 1 times [2023-11-19 05:16:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004310963] [2023-11-19 05:16:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:56,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004310963] [2023-11-19 05:16:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004310963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841587784] [2023-11-19 05:16:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:56,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:56,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:56,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:16:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:57,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 05:16:57,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:57,049 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 14 treesize of output 15 [2023-11-19 05:16:57,102 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 10 treesize of output 8 [2023-11-19 05:16:57,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-19 05:16:57,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2023-11-19 05:16:58,027 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:16:58,028 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 144 [2023-11-19 05:16:58,054 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2023-11-19 05:16:58,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 135 [2023-11-19 05:16:58,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2023-11-19 05:16:58,799 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-11-19 05:16:58,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 250 [2023-11-19 05:16:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:16:58,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 183 [2023-11-19 05:16:58,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 179 [2023-11-19 05:16:58,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 94 [2023-11-19 05:16:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:58,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:17:00,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse32 (select |c_#memory_int| .cse8)) (.cse33 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse0 (select .cse32 .cse33)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (< 100 .cse0) (let ((.cse1 (store |c_#memory_int| .cse8 (store .cse32 .cse33 (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12)) (.cse6 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse2 (select (select .cse6 .cse4) .cse5))) (or (forall ((v_DerPreprocessor_7 (Array Int Int))) (<= (select (select (store .cse1 .cse2 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse1 .cse2) (select (select .cse3 .cse4) .cse5)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse17 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse16 (+ .cse13 4))) (let ((.cse9 (select (select .cse17 .cse12) .cse16))) (let ((.cse10 (select .cse1 .cse9)) (.cse11 (select (select .cse15 .cse12) .cse16))) (let ((.cse14 (select .cse10 .cse11))) (or (< 90 (select (select (store .cse1 .cse9 (store .cse10 .cse11 (+ (* (- 1) (select (select .cse1 .cse12) .cse13)) .cse14))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse14 101))))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12)) (.cse22 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse21 (+ (select (select .cse19 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse18 (select (select .cse22 .cse20) .cse21))) (or (< 100 (select (select .cse1 .cse18) (select (select .cse19 .cse20) .cse21))) (forall ((v_prenex_15 (Array Int Int))) (<= 91 (select (select (store .cse1 .cse18 v_prenex_15) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse31 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse26 (select (select .cse31 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse30 (+ .cse27 4))) (let ((.cse23 (select (select .cse31 .cse26) .cse30))) (let ((.cse24 (select .cse1 .cse23)) (.cse25 (select (select .cse29 .cse26) .cse30))) (let ((.cse28 (select .cse24 .cse25))) (or (< (select (select (store .cse1 .cse23 (store .cse24 .cse25 (+ (* (- 1) (select (select .cse1 .cse26) .cse27)) .cse28))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse28 101)))))))))))) (or (< .cse0 101) (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9)) (.cse39 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse37 (select (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse38 (+ (select (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse34 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse35 (select (select .cse39 .cse37) .cse38))) (or (< 100 (select (select .cse34 .cse35) (select (select .cse36 .cse37) .cse38))) (forall ((v_DerPreprocessor_7 (Array Int Int))) (<= (select (select (store .cse34 .cse35 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse49 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse45 (select (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse48 (+ .cse46 4))) (let ((.cse41 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse42 (select (select .cse49 .cse45) .cse48))) (let ((.cse43 (select .cse41 .cse42)) (.cse44 (select (select .cse47 .cse45) .cse48))) (let ((.cse40 (select .cse43 .cse44))) (or (< .cse40 101) (< 90 (select (select (store .cse41 .cse42 (store .cse43 .cse44 (+ .cse40 (* (- 1) (select (select .cse41 .cse45) .cse46))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9)) (.cse55 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse53 (select (select .cse55 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse54 (+ (select (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse50 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse51 (select (select .cse55 .cse53) .cse54))) (or (forall ((v_prenex_14 (Array Int Int))) (<= 91 (select (select (store .cse50 .cse51 v_prenex_14) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse50 .cse51) (select (select .cse52 .cse53) .cse54)))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9))) (let ((.cse62 (select (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse65 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse61 (select (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse64 (+ .cse62 4))) (let ((.cse57 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse58 (select (select .cse65 .cse61) .cse64))) (let ((.cse59 (select .cse57 .cse58)) (.cse60 (select (select .cse63 .cse61) .cse64))) (let ((.cse56 (select .cse59 .cse60))) (or (< .cse56 101) (< (select (select (store .cse57 .cse58 (store .cse59 .cse60 (+ .cse56 (* (- 1) (select (select .cse57 .cse61) .cse62))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))))))))))))) is different from false [2023-11-19 05:17:00,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse32 (select |c_#memory_int| .cse8)) (.cse33 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select .cse32 .cse33))) (and (or (< 100 .cse0) (let ((.cse1 (store |c_#memory_int| .cse8 (store .cse32 .cse33 (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12)) (.cse6 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse2 (select (select .cse6 .cse4) .cse5))) (or (< 100 (select (select .cse1 .cse2) (select (select .cse3 .cse4) .cse5))) (forall ((v_prenex_15 (Array Int Int))) (<= 91 (select (select (store .cse1 .cse2 v_prenex_15) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse17 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse16 (+ .cse14 4))) (let ((.cse10 (select (select .cse17 .cse13) .cse16))) (let ((.cse11 (select .cse1 .cse10)) (.cse12 (select (select .cse15 .cse13) .cse16))) (let ((.cse9 (select .cse11 .cse12))) (or (< .cse9 101) (< 90 (select (select (store .cse1 .cse10 (store .cse11 .cse12 (+ .cse9 (* (- 1) (select (select .cse1 .cse13) .cse14))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12)) (.cse22 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse21 (+ (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse18 (select (select .cse22 .cse20) .cse21))) (or (forall ((v_DerPreprocessor_7 (Array Int Int))) (<= (select (select (store .cse1 .cse18 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse1 .cse18) (select (select .cse19 .cse20) .cse21)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_12))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse31 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_11))) (let ((.cse27 (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse30 (+ .cse28 4))) (let ((.cse24 (select (select .cse31 .cse27) .cse30))) (let ((.cse25 (select .cse1 .cse24)) (.cse26 (select (select .cse29 .cse27) .cse30))) (let ((.cse23 (select .cse25 .cse26))) (or (< .cse23 101) (< (select (select (store .cse1 .cse24 (store .cse25 .cse26 (+ .cse23 (* (- 1) (select (select .cse1 .cse27) .cse28))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))))))))) (or (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse43 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse39 (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse42 (+ .cse40 4))) (let ((.cse35 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse36 (select (select .cse43 .cse39) .cse42))) (let ((.cse37 (select .cse35 .cse36)) (.cse38 (select (select .cse41 .cse39) .cse42))) (let ((.cse34 (select .cse37 .cse38))) (or (< .cse34 101) (< (select (select (store .cse35 .cse36 (store .cse37 .cse38 (+ .cse34 (* (- 1) (select (select .cse35 .cse39) .cse40))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9)) (.cse49 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse47 (select (select .cse49 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse48 (+ (select (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse44 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse45 (select (select .cse49 .cse47) .cse48))) (or (< 100 (select (select .cse44 .cse45) (select (select .cse46 .cse47) .cse48))) (forall ((v_prenex_14 (Array Int Int))) (<= 91 (select (select (store .cse44 .cse45 v_prenex_14) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9)) (.cse55 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse53 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse54 (+ (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse50 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse51 (select (select .cse55 .cse53) .cse54))) (or (< 100 (select (select .cse50 .cse51) (select (select .cse52 .cse53) .cse54))) (forall ((v_DerPreprocessor_7 (Array Int Int))) (<= (select (select (store .cse50 .cse51 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| .cse8 v_DerPreprocessor_9))) (let ((.cse62 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse65 (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_8))) (let ((.cse61 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse64 (+ .cse62 4))) (let ((.cse56 (store |c_#memory_int| .cse8 v_DerPreprocessor_10)) (.cse57 (select (select .cse65 .cse61) .cse64))) (let ((.cse58 (select .cse56 .cse57)) (.cse59 (select (select .cse63 .cse61) .cse64))) (let ((.cse60 (select .cse58 .cse59))) (or (< 90 (select (select (store .cse56 .cse57 (store .cse58 .cse59 (+ .cse60 (* (- 1) (select (select .cse56 .cse61) .cse62))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse60 101)))))))))) (< .cse0 101))))))) is different from false [2023-11-19 05:17:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 05:17:01,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841587784] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:17:01,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097837008] [2023-11-19 05:17:01,183 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-19 05:17:01,184 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:17:01,184 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:17:01,184 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:17:01,184 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:17:05,538 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:17:10,875 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '251#(and (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem10#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem13#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem15#1_31| Int) (|v_ULTIMATE.start_main_#t~mem11#1_31| Int) (|v_ULTIMATE.start_main_~list~0#1.base_43| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_31| Int) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem14#1_31| Int) (|v_ULTIMATE.start_main_#t~mem10#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem12#1_31| Int) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~list~0#1.offset_44| Int)) (and (or (not (= |v_ULTIMATE.start_main_~list~0#1.offset_44| 0)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_43| 0))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (or (and (= |ULTIMATE.start_main_#t~mem11#1| |v_ULTIMATE.start_main_#t~mem11#1_31|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (<= 101 (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))) (= |ULTIMATE.start_main_#t~mem10#1.offset| |v_ULTIMATE.start_main_#t~mem10#1.offset_31|) (= |ULTIMATE.start_main_#t~mem12#1| |v_ULTIMATE.start_main_#t~mem12#1_31|) (= |#memory_int| (store |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (* (- 1) (select (select |v_#memory_int_91| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (= |ULTIMATE.start_main_#t~mem10#1.base| |v_ULTIMATE.start_main_#t~mem10#1.base_31|)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (= |ULTIMATE.start_main_#t~mem15#1| |v_ULTIMATE.start_main_#t~mem15#1_31|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |v_ULTIMATE.start_main_#t~mem13#1.offset_31|) (= |ULTIMATE.start_main_#t~mem14#1| |v_ULTIMATE.start_main_#t~mem14#1_31|) (= |#memory_int| (store |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (select (select |v_#memory_int_91| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|) (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))))) (= |ULTIMATE.start_main_#t~mem13#1.base| |v_ULTIMATE.start_main_#t~mem13#1.base_31|) (<= (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) 100) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))))))) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_28| Int) (|v_ULTIMATE.start_main_#t~mem18#1_29| Int)) (and (or (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) 91) |v_ULTIMATE.start_main_#t~short19#1_20|) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_29|)) (and (not |v_ULTIMATE.start_main_#t~short19#1_20|) (= |v_ULTIMATE.start_main_#t~mem18#1_29| |v_ULTIMATE.start_main_#t~mem18#1_28|))))))' at error location [2023-11-19 05:17:10,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:17:10,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:17:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-19 05:17:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840360957] [2023-11-19 05:17:10,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:17:10,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 05:17:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:17:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 05:17:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=166, Unknown=4, NotChecked=54, Total=272 [2023-11-19 05:17:10,880 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:17:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:17:12,899 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-11-19 05:17:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:17:12,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:17:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:17:12,904 INFO L225 Difference]: With dead ends: 21 [2023-11-19 05:17:12,904 INFO L226 Difference]: Without dead ends: 12 [2023-11-19 05:17:12,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=89, Invalid=295, Unknown=4, NotChecked=74, Total=462 [2023-11-19 05:17:12,908 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:17:12,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 22 Unchecked, 0.5s Time] [2023-11-19 05:17:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-19 05:17:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-19 05:17:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:17:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-19 05:17:12,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2023-11-19 05:17:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:17:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-19 05:17:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:17:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-19 05:17:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:17:12,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:17:12,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:17:12,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:17:13,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:17:13,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:17:13,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:17:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1538386312, now seen corresponding path program 1 times [2023-11-19 05:17:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:17:13,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61474988] [2023-11-19 05:17:13,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:13,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:17:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:17:18,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:17:18,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61474988] [2023-11-19 05:17:18,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61474988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:17:18,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867820228] [2023-11-19 05:17:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:17:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:17:18,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:17:18,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa9e497a-78bf-4bc5-9e85-3957a3565766/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:17:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:18,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-19 05:17:18,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:17:18,774 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:17:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:17:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-19 05:17:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-19 05:17:18,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2023-11-19 05:17:19,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:19,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2023-11-19 05:17:19,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2023-11-19 05:17:19,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:19,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:19,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-19 05:17:19,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-19 05:17:20,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:20,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-19 05:17:20,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-19 05:17:20,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:20,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:17:20,749 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 05:17:20,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 21 [2023-11-19 05:17:20,950 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2023-11-19 05:17:20,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 176 [2023-11-19 05:17:22,809 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-19 05:17:22,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 329 treesize of output 292 [2023-11-19 05:17:23,128 INFO L349 Elim1Store]: treesize reduction 176, result has 17.4 percent of original size [2023-11-19 05:17:23,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 315 treesize of output 277