./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/s1lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:29:04,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:29:04,793 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:29:04,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:29:04,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:29:04,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:29:04,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:29:04,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:29:04,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:29:04,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:29:04,849 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:29:04,850 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:29:04,851 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:29:04,853 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:29:04,853 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:29:04,854 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:29:04,854 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:29:04,855 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:29:04,855 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:29:04,856 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:29:04,858 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:29:04,859 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:29:04,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:29:04,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:29:04,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:29:04,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:29:04,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:29:04,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:29:04,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:29:04,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:29:04,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:29:04,865 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:29:04,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:29:04,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:29:04,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:29:04,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:29:04,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:29:04,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:29:04,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:29:04,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:29:04,867 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:29:04,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:29:04,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:29:04,868 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:29:04,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:29:04,869 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_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/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_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2023-11-06 20:29:05,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:29:05,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:29:05,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:29:05,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:29:05,270 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:29:05,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/array-fpi/s1lif.c [2023-11-06 20:29:08,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:29:08,536 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:29:08,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/sv-benchmarks/c/array-fpi/s1lif.c [2023-11-06 20:29:08,546 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/data/15ece3de9/c24c27255689441bac82a95a2baba714/FLAG264ef944d [2023-11-06 20:29:08,565 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/data/15ece3de9/c24c27255689441bac82a95a2baba714 [2023-11-06 20:29:08,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:29:08,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:29:08,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:29:08,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:29:08,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:29:08,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:08,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4989d46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08, skipping insertion in model container [2023-11-06 20:29:08,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:08,614 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:29:08,814 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_738280f8-80ba-443b-b723-1946154d8103/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2023-11-06 20:29:08,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:29:08,864 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:29:08,882 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_738280f8-80ba-443b-b723-1946154d8103/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2023-11-06 20:29:08,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:29:08,919 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:29:08,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08 WrapperNode [2023-11-06 20:29:08,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:29:08,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:29:08,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:29:08,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:29:08,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:08,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:08,982 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-11-06 20:29:08,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:29:08,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:29:08,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:29:08,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:29:08,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:08,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:29:09,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:29:09,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:29:09,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:29:09,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (1/1) ... [2023-11-06 20:29:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:29:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:09,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:29:09,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:29:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:29:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:29:09,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:29:09,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:29:09,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:29:09,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:29:09,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:29:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:29:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:29:09,235 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:29:09,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:29:09,478 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:29:09,572 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:29:09,572 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 20:29:09,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:29:09 BoogieIcfgContainer [2023-11-06 20:29:09,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:29:09,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:29:09,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:29:09,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:29:09,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:29:08" (1/3) ... [2023-11-06 20:29:09,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340b9e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:29:09, skipping insertion in model container [2023-11-06 20:29:09,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:29:08" (2/3) ... [2023-11-06 20:29:09,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340b9e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:29:09, skipping insertion in model container [2023-11-06 20:29:09,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:29:09" (3/3) ... [2023-11-06 20:29:09,612 INFO L112 eAbstractionObserver]: Analyzing ICFG s1lif.c [2023-11-06 20:29:09,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:29:09,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:29:09,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:29:09,707 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=LoopsAndPotentialCycles, 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;@f240340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:29:09,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:29:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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-06 20:29:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:29:09,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:09,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:09,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:09,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash -535561234, now seen corresponding path program 1 times [2023-11-06 20:29:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:09,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575389938] [2023-11-06 20:29:09,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:10,101 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-06 20:29:10,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:10,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575389938] [2023-11-06 20:29:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575389938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:10,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:10,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:29:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408070329] [2023-11-06 20:29:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:10,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:29:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:29:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:29:10,143 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-06 20:29:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:10,190 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2023-11-06 20:29:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:29:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-06 20:29:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:10,201 INFO L225 Difference]: With dead ends: 20 [2023-11-06 20:29:10,201 INFO L226 Difference]: Without dead ends: 9 [2023-11-06 20:29:10,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:29:10,208 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:10,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:29:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-06 20:29:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-06 20:29:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-06 20:29:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-11-06 20:29:10,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2023-11-06 20:29:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:10,243 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-06 20:29:10,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-06 20:29:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-11-06 20:29:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 20:29:10,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:10,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:29:10,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:10,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 344823405, now seen corresponding path program 1 times [2023-11-06 20:29:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:10,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064153992] [2023-11-06 20:29:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:10,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064153992] [2023-11-06 20:29:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064153992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:29:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931874891] [2023-11-06 20:29:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:10,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:10,409 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-06 20:29:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:10,458 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-06 20:29:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-06 20:29:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:10,460 INFO L225 Difference]: With dead ends: 15 [2023-11-06 20:29:10,461 INFO L226 Difference]: Without dead ends: 11 [2023-11-06 20:29:10,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:29:10,465 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:10,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:29:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-06 20:29:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-06 20:29:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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-06 20:29:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-06 20:29:10,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-11-06 20:29:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:10,471 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-06 20:29:10,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-06 20:29:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-06 20:29:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:29:10,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:10,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:10,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:29:10,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:10,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 750922709, now seen corresponding path program 1 times [2023-11-06 20:29:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825763372] [2023-11-06 20:29:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:11,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825763372] [2023-11-06 20:29:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825763372] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221097732] [2023-11-06 20:29:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:11,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:11,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:11,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:29:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:11,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 20:29:11,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:11,816 INFO L351 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-06 20:29:11,837 INFO L351 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 11 treesize of output 7 [2023-11-06 20:29:11,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 20:29:11,962 INFO L351 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 26 treesize of output 21 [2023-11-06 20:29:12,077 INFO L351 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 26 treesize of output 21 [2023-11-06 20:29:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:12,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221097732] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:29:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [960870017] [2023-11-06 20:29:12,664 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 20:29:12,664 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:12,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:12,678 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:12,679 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:13,198 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:29:13,586 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '173#(and (not (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem14#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))' at error location [2023-11-06 20:29:13,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:29:13,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:29:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-06 20:29:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955839438] [2023-11-06 20:29:13,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:29:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 20:29:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 20:29:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=427, Unknown=4, NotChecked=0, Total=506 [2023-11-06 20:29:13,590 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-06 20:29:16,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 20:29:18,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 20:29:20,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 20:29:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:20,275 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-11-06 20:29:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 20:29:20,276 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 20:29:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:20,278 INFO L225 Difference]: With dead ends: 21 [2023-11-06 20:29:20,278 INFO L226 Difference]: Without dead ends: 18 [2023-11-06 20:29:20,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=551, Unknown=4, NotChecked=0, Total=650 [2023-11-06 20:29:20,280 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:20,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 6.5s Time] [2023-11-06 20:29:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-06 20:29:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2023-11-06 20:29:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:29:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-11-06 20:29:20,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2023-11-06 20:29:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:20,290 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-11-06 20:29:20,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-06 20:29:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-11-06 20:29:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:29:20,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:20,291 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:20,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:20,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:20,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:20,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1803519565, now seen corresponding path program 2 times [2023-11-06 20:29:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730547542] [2023-11-06 20:29:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:20,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730547542] [2023-11-06 20:29:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730547542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048827078] [2023-11-06 20:29:20,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:29:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:20,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:20,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:29:20,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 20:29:20,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:29:20,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 20:29:20,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:20,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048827078] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:29:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670854750] [2023-11-06 20:29:20,831 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 20:29:20,832 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:20,832 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:20,832 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:20,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:21,276 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:29:21,636 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '314#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (not (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem14#1|)) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0) |ULTIMATE.start_main_#t~mem14#1|) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))' at error location [2023-11-06 20:29:21,636 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:29:21,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:29:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 20:29:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831020306] [2023-11-06 20:29:21,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:29:21,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 20:29:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:21,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 20:29:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-06 20:29:21,639 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-06 20:29:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:21,780 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-11-06 20:29:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:29:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 20:29:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:21,782 INFO L225 Difference]: With dead ends: 32 [2023-11-06 20:29:21,782 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 20:29:21,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-11-06 20:29:21,784 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:21,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 20:29:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2023-11-06 20:29:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-06 20:29:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-06 20:29:21,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2023-11-06 20:29:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:21,797 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-06 20:29:21,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-06 20:29:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-06 20:29:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:29:21,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:21,798 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:21,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:22,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:22,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:22,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1075573514, now seen corresponding path program 3 times [2023-11-06 20:29:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:22,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14216460] [2023-11-06 20:29:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:22,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14216460] [2023-11-06 20:29:22,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14216460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105682829] [2023-11-06 20:29:22,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 20:29:22,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:22,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:22,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:22,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:29:22,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 20:29:22,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:29:22,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 20:29:22,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:22,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:29:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105682829] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:29:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1975999455] [2023-11-06 20:29:22,305 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 20:29:22,306 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:22,306 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:22,306 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:22,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:22,975 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:29:23,226 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '469#(and (not (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem14#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))' at error location [2023-11-06 20:29:23,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:29:23,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:29:23,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 20:29:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140896358] [2023-11-06 20:29:23,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:29:23,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 20:29:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 20:29:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-06 20:29:23,228 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-06 20:29:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:23,350 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2023-11-06 20:29:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:29:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 20:29:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:23,352 INFO L225 Difference]: With dead ends: 19 [2023-11-06 20:29:23,352 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 20:29:23,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-11-06 20:29:23,354 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:23,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 20:29:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 20:29:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-06 20:29:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-06 20:29:23,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-11-06 20:29:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:23,368 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-06 20:29:23,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-06 20:29:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-06 20:29:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 20:29:23,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:23,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:23,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:23,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:23,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:29:23,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash 135501902, now seen corresponding path program 4 times [2023-11-06 20:29:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071181997] [2023-11-06 20:29:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:24,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071181997] [2023-11-06 20:29:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071181997] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:24,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818217985] [2023-11-06 20:29:24,961 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 20:29:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:24,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:24,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_738280f8-80ba-443b-b723-1946154d8103/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:29:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:25,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 20:29:25,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:25,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:29:25,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 20:29:25,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 20:29:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 20:29:25,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 20:29:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 20:29:25,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:25,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 20:29:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:25,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:26,365 INFO L351 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 3 [2023-11-06 20:29:26,454 INFO L322 Elim1Store]: treesize reduction 12, result has 74.5 percent of original size [2023-11-06 20:29:26,455 INFO L351 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 140 [2023-11-06 20:29:29,146 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (* c_~N~0 2)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse33 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (= (select .cse33 .cse34) 1)) (.cse26 (forall ((v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_2))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse39))))))) (.cse7 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (let ((.cse12 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (let ((.cse16 (not .cse12))) (and (or (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) (not (= 2 (select v_arrayElimArr_1 .cse7))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (+ .cse8 2 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (= .cse1 (let ((.cse11 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (not (= 2 (select v_arrayElimArr_1 .cse7))))))))) .cse12) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse1 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= 2 (select v_arrayElimArr_1 .cse7))))) .cse12) (or .cse16 (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse1 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 2 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1)) (= .cse1 (+ .cse20 2 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))))) .cse16) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1)) (= .cse1 (+ .cse23 2 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= 2 (select v_arrayElimArr_1 .cse7)))))))) .cse26)))) (or (not .cse0) (let ((.cse27 (= (select .cse33 .cse7) 1))) (and (or .cse27 .cse26) (or (not .cse27) (= .cse1 (let ((.cse32 (store (store .cse33 .cse34 2) .cse7 2))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))))))))))) is different from false [2023-11-06 20:29:33,700 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse24 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse11 (+ .cse6 2)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (forall ((v_DerPreprocessor_2 (Array Int Int))) (= .cse11 (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_2))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse28))))))) (.cse19 (= (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (or (let ((.cse1 (+ .cse6 1))) (and .cse0 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse1 (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse6 (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (not (= (select v_arrayElimArr_1 .cse5) 2))))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) .cse11) (not (= (select v_arrayElimArr_1 .cse5) 2)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (let ((.cse12 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse12 .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) .cse11) (= .cse6 (+ .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (not (= (select v_arrayElimArr_1 .cse5) 2))))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse1 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= (select v_arrayElimArr_1 .cse5) 2)))))) .cse19) (or (let ((.cse20 (= (select .cse24 .cse5) 1))) (and (or .cse0 .cse20) (or (not .cse20) (= .cse6 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| 2) .cse5 2)))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse23)))))))) (not .cse19)))))) is different from false [2023-11-06 20:29:36,302 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (let ((.cse30 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) (.cse16 (+ .cse25 4)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse7 (forall ((v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_2))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse29))))))) (.cse0 (+ .cse25 2)) (.cse8 (= (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (or (let ((.cse6 (= (select .cse5 .cse4) 1))) (and (or (= .cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 2) .cse4 2)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not .cse6)) (or .cse6 .cse7))) (not .cse8)) (or (let ((.cse9 (+ .cse25 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse9 (+ .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (+ .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) .cse0) (not (= (select v_arrayElimArr_1 .cse4) 2))))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse9 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= (select v_arrayElimArr_1 .cse4) 2)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse16 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not (= (select v_arrayElimArr_1 .cse4) 2)))) .cse7 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_1))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= .cse16 (let ((.cse21 (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) .cse0) (not (= (select v_arrayElimArr_1 .cse4) 2))))))))) .cse8))))) is different from false [2023-11-06 20:29:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-06 20:29:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818217985] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:29:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924388534] [2023-11-06 20:29:36,413 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-06 20:29:36,413 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:36,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:36,414 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:36,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:36,898 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:29:39,702 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '634#(and (not (= (* 2 ~N~0) |ULTIMATE.start_main_#t~mem14#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))' at error location [2023-11-06 20:29:39,702 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:29:39,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:29:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2023-11-06 20:29:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298387270] [2023-11-06 20:29:39,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:29:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 20:29:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:39,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 20:29:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=869, Unknown=11, NotChecked=186, Total=1190 [2023-11-06 20:29:39,706 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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)