./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:09:54,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:09:54,431 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:09:54,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:09:54,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:09:54,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:09:54,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:09:54,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:09:54,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:09:54,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:09:54,468 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:09:54,469 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:09:54,470 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:09:54,470 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:09:54,471 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:09:54,472 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:09:54,473 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:09:54,473 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:09:54,474 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:09:54,475 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:09:54,475 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:09:54,476 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:09:54,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:09:54,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:09:54,478 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:09:54,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:09:54,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:09:54,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:09:54,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:09:54,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:09:54,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:09:54,482 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:09:54,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:09:54,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:09:54,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:09:54,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:09:54,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:09:54,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:09:54,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:09:54,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:09:54,486 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:09:54,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:09:54,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:09:54,488 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:09:54,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:09:54,489 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/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_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba [2023-11-12 00:09:54,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:09:54,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:09:54,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:09:54,829 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:09:54,830 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:09:54,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2023-11-12 00:09:58,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:09:58,522 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:09:58,522 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2023-11-12 00:09:58,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/data/f7d15a90f/8a55018680664bfeb221f7571efda8e3/FLAGe017d6734 [2023-11-12 00:09:58,563 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/data/f7d15a90f/8a55018680664bfeb221f7571efda8e3 [2023-11-12 00:09:58,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:09:58,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:09:58,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:09:58,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:09:58,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:09:58,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:58" (1/1) ... [2023-11-12 00:09:58,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:58, skipping insertion in model container [2023-11-12 00:09:58,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:58" (1/1) ... [2023-11-12 00:09:58,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:09:59,078 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2023-11-12 00:09:59,083 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2023-11-12 00:09:59,091 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2023-11-12 00:09:59,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:09:59,118 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:09:59,155 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2023-11-12 00:09:59,157 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2023-11-12 00:09:59,162 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_c910139f-15ac-4f16-b358-f31b6d0eb92a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2023-11-12 00:09:59,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:09:59,198 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:09:59,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59 WrapperNode [2023-11-12 00:09:59,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:09:59,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:09:59,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:09:59,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:09:59,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,251 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-12 00:09:59,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:09:59,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:09:59,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:09:59,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:09:59,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:09:59,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:09:59,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:09:59,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:09:59,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (1/1) ... [2023-11-12 00:09:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:09:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:59,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:09:59,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:09:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:09:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:09:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:09:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:09:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:09:59,558 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:09:59,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:09:59,839 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:09:59,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:09:59,979 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-12 00:09:59,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:59 BoogieIcfgContainer [2023-11-12 00:09:59,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:09:59,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:09:59,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:09:59,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:09:59,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:09:58" (1/3) ... [2023-11-12 00:09:59,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67830545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:59, skipping insertion in model container [2023-11-12 00:09:59,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:59" (2/3) ... [2023-11-12 00:09:59,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67830545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:59, skipping insertion in model container [2023-11-12 00:09:59,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:59" (3/3) ... [2023-11-12 00:09:59,994 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2023-11-12 00:10:00,015 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:10:00,015 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-12 00:10:00,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:10:00,100 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78c4131c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:10:00,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-12 00:10:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 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-12 00:10:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:10:00,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:00,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:10:00,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:00,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1014884411, now seen corresponding path program 1 times [2023-11-12 00:10:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614375687] [2023-11-12 00:10:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:00,311 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-12 00:10:00,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614375687] [2023-11-12 00:10:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614375687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:10:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61634558] [2023-11-12 00:10:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:10:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:10:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:10:00,355 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:00,466 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2023-11-12 00:10:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:10:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:10:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:00,480 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:10:00,480 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:10:00,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:10:00,491 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:00,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:10:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:10:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-12 00:10:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-12 00:10:00,538 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2023-11-12 00:10:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:00,538 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-12 00:10:00,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-12 00:10:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:10:00,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:00,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:10:00,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:00,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1773939347, now seen corresponding path program 1 times [2023-11-12 00:10:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014623920] [2023-11-12 00:10:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:01,034 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-12 00:10:01,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014623920] [2023-11-12 00:10:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014623920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:10:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832127788] [2023-11-12 00:10:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:10:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:10:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:10:01,039 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.6) 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-12 00:10:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:01,454 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2023-11-12 00:10:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:10:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) 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-12 00:10:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:01,457 INFO L225 Difference]: With dead ends: 52 [2023-11-12 00:10:01,457 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 00:10:01,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:10:01,460 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:01,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:10:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 00:10:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-11-12 00:10:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 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-12 00:10:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-12 00:10:01,470 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2023-11-12 00:10:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:01,471 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-12 00:10:01,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) 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-12 00:10:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-12 00:10:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:10:01,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:01,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:01,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:10:01,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:01,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1773940597, now seen corresponding path program 1 times [2023-11-12 00:10:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936114757] [2023-11-12 00:10:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:01,536 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-12 00:10:01,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936114757] [2023-11-12 00:10:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936114757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:01,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:10:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54443200] [2023-11-12 00:10:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:01,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:01,540 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-12 00:10:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:01,733 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-12 00:10:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-12 00:10:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:01,737 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:10:01,738 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:10:01,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:10:01,746 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:01,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:10:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:10:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-11-12 00:10:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 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-12 00:10:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-12 00:10:01,764 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 8 [2023-11-12 00:10:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:01,765 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-12 00:10:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-12 00:10:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-12 00:10:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:10:01,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:01,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:01,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:10:01,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:01,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1936633858, now seen corresponding path program 1 times [2023-11-12 00:10:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:01,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869725511] [2023-11-12 00:10:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:02,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869725511] [2023-11-12 00:10:02,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869725511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138426014] [2023-11-12 00:10:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:02,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:02,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:02,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:10:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:02,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-12 00:10:02,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:02,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:10:02,756 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 18 treesize of output 7 [2023-11-12 00:10:02,766 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 18 treesize of output 7 [2023-11-12 00:10:03,344 INFO L322 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-11-12 00:10:03,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 207 [2023-11-12 00:10:03,440 INFO L322 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-11-12 00:10:03,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 234 [2023-11-12 00:10:03,500 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:10:03,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 188 [2023-11-12 00:10:03,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:10:03,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:10:03,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:03,709 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:10:03,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:10:03,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-12 00:10:03,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2023-11-12 00:10:03,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-12 00:10:03,869 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 7 treesize of output 5 [2023-11-12 00:10:03,875 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 12 treesize of output 8 [2023-11-12 00:10:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:03,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:04,106 INFO L322 Elim1Store]: treesize reduction 12, result has 70.0 percent of original size [2023-11-12 00:10:04,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 213 [2023-11-12 00:10:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138426014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:10:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [130022802] [2023-11-12 00:10:04,922 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:10:04,922 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:10:04,926 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:10:04,932 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:10:04,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:10:10,319 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:10:11,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '439#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~prev~0#1.offset|) (= |ULTIMATE.start_main_~prev~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-11-12 00:10:11,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:10:11,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:10:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-12 00:10:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961926552] [2023-11-12 00:10:11,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:10:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:10:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:10:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=197, Unknown=6, NotChecked=0, Total=272 [2023-11-12 00:10:11,160 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 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) [2023-11-12 00:10:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:13,509 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-11-12 00:10:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:10:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 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) Word has length 14 [2023-11-12 00:10:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:13,513 INFO L225 Difference]: With dead ends: 68 [2023-11-12 00:10:13,513 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 00:10:13,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=108, Invalid=302, Unknown=10, NotChecked=0, Total=420 [2023-11-12 00:10:13,515 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:13,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 14 Unknown, 0 Unchecked, 1.9s Time] [2023-11-12 00:10:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 00:10:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2023-11-12 00:10:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 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-12 00:10:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-11-12 00:10:13,531 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 14 [2023-11-12 00:10:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:13,531 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-11-12 00:10:13,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 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) [2023-11-12 00:10:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-11-12 00:10:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:10:13,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:13,533 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:13,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:10:13,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:13,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:13,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 22111694, now seen corresponding path program 2 times [2023-11-12 00:10:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409200327] [2023-11-12 00:10:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:15,025 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-12 00:10:15,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:15,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409200327] [2023-11-12 00:10:15,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409200327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:15,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848530725] [2023-11-12 00:10:15,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:10:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:15,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:15,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:10:15,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:10:15,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:10:15,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-12 00:10:15,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:15,345 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 18 treesize of output 7 [2023-11-12 00:10:15,352 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 18 treesize of output 7 [2023-11-12 00:10:15,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:10:15,635 INFO L322 Elim1Store]: treesize reduction 26, result has 39.5 percent of original size [2023-11-12 00:10:15,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 219 [2023-11-12 00:10:15,710 INFO L322 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-11-12 00:10:15,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 205 [2023-11-12 00:10:15,776 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:10:15,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 198 [2023-11-12 00:10:15,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:10:15,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:10:15,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 00:10:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,929 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 21 treesize of output 1 [2023-11-12 00:10:15,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,947 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 21 treesize of output 1 [2023-11-12 00:10:15,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-12 00:10:15,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 00:10:15,990 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:10:15,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:10:16,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-12 00:10:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:16,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-11-12 00:10:16,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2023-11-12 00:10:16,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-12 00:10:16,281 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 7 treesize of output 5 [2023-11-12 00:10:16,287 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 18 treesize of output 12 [2023-11-12 00:10:16,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:10:16,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:10:16,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 00:10:16,346 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-12 00:10:16,466 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-12 00:10:16,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:16,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ |c_ULTIMATE.start_main_~prev~0#1.offset| 4)) 1)) is different from false [2023-11-12 00:10:16,501 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_282) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_286) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (not (= v_ArrVal_282 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_282 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-11-12 00:10:16,683 INFO L322 Elim1Store]: treesize reduction 12, result has 76.9 percent of original size [2023-11-12 00:10:16,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 225 [2023-11-12 00:10:16,760 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:16,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2023-11-12 00:10:16,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-12 00:10:17,017 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 00:10:17,017 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 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-12 00:10:17,070 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:10:17,070 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 1 case distinctions, treesize of input 20 treesize of output 20 [2023-11-12 00:10:17,090 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 8 treesize of output 4 [2023-11-12 00:10:17,256 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:17,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 173 [2023-11-12 00:10:17,280 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 15 treesize of output 11 [2023-11-12 00:10:17,297 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 8 treesize of output 4 [2023-11-12 00:10:17,370 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 7 treesize of output 3 [2023-11-12 00:10:17,397 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:17,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 119 [2023-11-12 00:10:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-12 00:10:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848530725] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:10:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1885269455] [2023-11-12 00:10:18,045 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:10:18,045 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:10:18,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:10:18,046 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:10:18,046 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:10:23,249 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:10:24,084 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '708#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~prev~0#1.offset|) (= |ULTIMATE.start_main_~prev~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-11-12 00:10:24,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:10:24,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:10:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-12 00:10:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762032818] [2023-11-12 00:10:24,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:10:24,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:10:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:10:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=395, Unknown=4, NotChecked=82, Total=552 [2023-11-12 00:10:24,088 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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-12 00:10:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:24,706 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-11-12 00:10:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:10:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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 15 [2023-11-12 00:10:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:24,708 INFO L225 Difference]: With dead ends: 60 [2023-11-12 00:10:24,708 INFO L226 Difference]: Without dead ends: 58 [2023-11-12 00:10:24,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=92, Invalid=512, Unknown=4, NotChecked=94, Total=702 [2023-11-12 00:10:24,712 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:24,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 188 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 74 Unchecked, 0.4s Time] [2023-11-12 00:10:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-12 00:10:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-11-12 00:10:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 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-12 00:10:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-12 00:10:24,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 15 [2023-11-12 00:10:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:24,729 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-12 00:10:24,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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-12 00:10:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-11-12 00:10:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:10:24,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:24,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:24,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:10:24,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:24,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:24,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash -560672479, now seen corresponding path program 1 times [2023-11-12 00:10:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782051136] [2023-11-12 00:10:24,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:10:25,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782051136] [2023-11-12 00:10:25,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782051136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:25,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513104819] [2023-11-12 00:10:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:25,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:25,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:10:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:25,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-12 00:10:25,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:25,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-12 00:10:25,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-12 00:10:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:10:25,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:10:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513104819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:10:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790676992] [2023-11-12 00:10:25,385 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-12 00:10:25,386 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:10:25,386 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:10:25,386 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:10:25,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:10:29,775 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:10:30,262 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '969#(and (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_36| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_36| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_36| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_36| 2147483647))))' at error location [2023-11-12 00:10:30,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:10:30,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:10:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-12 00:10:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033072616] [2023-11-12 00:10:30,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:10:30,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:10:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:10:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:10:30,264 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-12 00:10:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:30,444 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-12 00:10:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:10:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 15 [2023-11-12 00:10:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:30,446 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:10:30,446 INFO L226 Difference]: Without dead ends: 46 [2023-11-12 00:10:30,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:10:30,447 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:30,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-12 00:10:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-12 00:10:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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-12 00:10:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-11-12 00:10:30,464 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2023-11-12 00:10:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:30,464 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-11-12 00:10:30,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-12 00:10:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-11-12 00:10:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:10:30,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:30,465 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:30,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:10:30,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:30,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:30,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash 613681662, now seen corresponding path program 3 times [2023-11-12 00:10:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602688517] [2023-11-12 00:10:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:31,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602688517] [2023-11-12 00:10:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602688517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490195340] [2023-11-12 00:10:31,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:10:31,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:31,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:31,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:31,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c910139f-15ac-4f16-b358-f31b6d0eb92a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:10:32,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:10:32,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:10:32,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-12 00:10:32,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:32,115 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 18 treesize of output 7 [2023-11-12 00:10:32,122 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 18 treesize of output 7 [2023-11-12 00:10:32,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:10:32,425 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-12 00:10:32,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 213 [2023-11-12 00:10:32,487 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:10:32,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 184 [2023-11-12 00:10:32,638 INFO L322 Elim1Store]: treesize reduction 104, result has 24.1 percent of original size [2023-11-12 00:10:32,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 187 treesize of output 261 [2023-11-12 00:10:32,749 INFO L322 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-12 00:10:32,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 219 [2023-11-12 00:10:32,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:10:32,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:32,861 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 00:10:32,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 7 [2023-11-12 00:10:32,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2023-11-12 00:10:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:32,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2023-11-12 00:10:32,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:32,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 85 [2023-11-12 00:10:34,154 INFO L322 Elim1Store]: treesize reduction 756, result has 13.7 percent of original size [2023-11-12 00:10:34,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 12 new quantified variables, introduced 35 case distinctions, treesize of input 984 treesize of output 1165 [2023-11-12 00:10:34,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 239 [2023-11-12 00:10:34,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 227 [2023-11-12 00:10:34,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 219 [2023-11-12 00:10:34,527 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 25 treesize of output 18 [2023-11-12 00:10:35,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:35,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2023-11-12 00:10:35,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 181 [2023-11-12 00:10:35,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:10:35,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2023-11-12 00:10:36,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 806 treesize of output 798 [2023-11-12 00:10:37,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1140 treesize of output 832 [2023-11-12 00:10:38,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:38,695 INFO L322 Elim1Store]: treesize reduction 185, result has 42.0 percent of original size [2023-11-12 00:10:38,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 1444 treesize of output 1317 [2023-11-12 00:10:38,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:38,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:38,960 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:39,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:39,104 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 43 treesize of output 33 [2023-11-12 00:10:39,115 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 43 treesize of output 33 [2023-11-12 00:10:39,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2023-11-12 00:10:39,231 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 30 treesize of output 22 [2023-11-12 00:10:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:39,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:39,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_493) .cse0) .cse1) 0)) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_492) .cse0) .cse1) 0)))) is different from false [2023-11-12 00:10:39,605 INFO L322 Elim1Store]: treesize reduction 12, result has 70.0 percent of original size [2023-11-12 00:10:39,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 273 [2023-11-12 00:10:39,893 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 5 treesize of output 3 [2023-11-12 00:10:41,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse36 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (= (select .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (.cse8 (= .cse36 0)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_59 .cse0)) (= .cse0 0) (not (= .cse1 (store .cse2 .cse3 (select .cse1 .cse3)))) (not (= v_DerPreprocessor_60 .cse1)) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse0 v_DerPreprocessor_62))) (select (select (store .cse4 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))) (or (not .cse7) (not .cse8) (let ((.cse13 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse14 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (let ((.cse10 (store .cse2 0 0)) (.cse11 (store .cse6 0 0))) (and (forall ((v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_64 Int) (v_DerPreprocessor_63 Int)) (= (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 4 v_DerPreprocessor_64)))) (select (select (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse10 4 v_DerPreprocessor_63)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (forall ((v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_64 Int) (v_DerPreprocessor_63 Int)) (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse10 4 v_DerPreprocessor_63)))) (select (store .cse12 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 4 v_DerPreprocessor_64)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) .cse13 (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) .cse14) (or (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 4)) .cse13 (and (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_72 Int) (v_DerPreprocessor_70 Int) (v_DerPreprocessor_73 Int)) (= (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse2 8 v_DerPreprocessor_70) 0 0) 4 v_DerPreprocessor_71)))) (select (store .cse15 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_72) 0 0) 4 v_DerPreprocessor_73)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_DerPreprocessor_72 Int) (v_DerPreprocessor_70 Int) (v_DerPreprocessor_73 Int)) (= (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_72) 0 0) 4 v_DerPreprocessor_73)))) (select (select (store .cse16 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse2 8 v_DerPreprocessor_70) 0 0) 4 v_DerPreprocessor_71)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) .cse14) (forall ((v_DerPreprocessor_68 Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_67 Int)) (let ((.cse19 (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse2 .cse3 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_67)))) (store .cse22 v_DerPreprocessor_67 (store (store (select .cse22 v_DerPreprocessor_67) 0 0) 4 v_DerPreprocessor_69))))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse17) 0)) (= .cse17 0) (not (= (select .cse18 .cse3) v_DerPreprocessor_68)) (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_65 Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse3 v_DerPreprocessor_65) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse21 .cse17 (store (store (select .cse21 .cse17) 0 0) 4 v_DerPreprocessor_66))))) (or (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store .cse19 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_65 (select (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)))))) (not (= v_DerPreprocessor_67 .cse17))))))) (forall ((v_DerPreprocessor_68 Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_67 Int)) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse2 .cse3 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_67)))) (store .cse28 v_DerPreprocessor_67 (store (store (select .cse28 v_DerPreprocessor_67) 0 0) 4 v_DerPreprocessor_69))))) (let ((.cse27 (select .cse25 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse23) 0)) (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_65 Int)) (let ((.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse3 v_DerPreprocessor_65) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse26 .cse23 (store (store (select .cse26 .cse23) 0 0) 4 v_DerPreprocessor_66))))) (or (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store .cse24 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_65 (select (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)))))) (= .cse23 0) (not (= (select .cse27 .cse3) v_DerPreprocessor_68)) (not (= v_DerPreprocessor_67 .cse23)))))))))) (or .cse7 (and (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61))) (let ((.cse30 (select .cse32 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_59 .cse29)) (not (= .cse30 (store .cse2 .cse3 (select .cse30 .cse3)))) (not (= v_DerPreprocessor_60 .cse30)) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse29 v_DerPreprocessor_62))) (select (select (store .cse31 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (select (store .cse33 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse34 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_59 .cse34)) (not (= .cse35 (store .cse2 .cse3 (select .cse35 .cse3)))) (not (= v_DerPreprocessor_60 .cse35))))))))) (or (not (= .cse36 |c_ULTIMATE.start_main_~x~0#1.base|)) (and .cse7 .cse8) (and (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse36 v_DerPreprocessor_75))) (select (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse36 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (let ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse36 v_DerPreprocessor_74))) (select (select (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| .cse36 v_DerPreprocessor_75) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61))) (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (select (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 .cse3 v_ArrVal_481)) .cse40 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_59 .cse40)) (= .cse40 0) (not (= .cse41 (store .cse2 .cse3 (select .cse41 .cse3)))) (not (= v_DerPreprocessor_60 .cse41))))))))))) is different from false [2023-11-12 00:10:44,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse19 (select .cse10 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (= .cse19 0)) (.cse0 (= (select .cse7 |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (or (not .cse0) (not .cse1) (let ((.cse17 (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (.cse18 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 0)))) (and (forall ((v_DerPreprocessor_68 Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_67 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse10 .cse3 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_67)))) (let ((.cse4 (store (store (select .cse9 v_DerPreprocessor_67) 0 0) 4 v_DerPreprocessor_69))) (let ((.cse8 (select (store .cse9 v_DerPreprocessor_67 .cse4) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_65 Int)) (let ((.cse2 (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse7 .cse3 v_DerPreprocessor_65) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (store .cse6 .cse5 (store (store (select .cse6 .cse5) 0 0) 4 v_DerPreprocessor_66))) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse2 .cse3) v_DerPreprocessor_65)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_67 .cse4) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse5) (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (= .cse5 0) (not (= v_DerPreprocessor_67 .cse5)) (not (= (select .cse8 .cse3) v_DerPreprocessor_68)) (not (= (select |c_#valid| .cse5) 0)))))))) (forall ((v_DerPreprocessor_68 Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_67 Int)) (let ((.cse15 (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse10 .cse3 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_67)))) (store .cse16 v_DerPreprocessor_67 (store (store (select .cse16 v_DerPreprocessor_67) 0 0) 4 v_DerPreprocessor_69))) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 0) (not (= v_DerPreprocessor_67 .cse11)) (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_65 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse7 .cse3 v_DerPreprocessor_65) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (let ((.cse13 (store (store (select .cse14 .cse11) 0 0) 4 v_DerPreprocessor_66))) (let ((.cse12 (select (store .cse14 .cse11 .cse13) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse12 .cse3) v_DerPreprocessor_65)) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse11 .cse13) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse11) (select .cse12 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))) (not (= (select .cse15 .cse3) v_DerPreprocessor_68)) (not (= (select |c_#valid| .cse11) 0)))))) (or .cse17 (not (= |c_ULTIMATE.start_main_~head~0#1.offset| 4)) .cse18 (and (forall ((v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_DerPreprocessor_73 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) v_DerPreprocessor_71) v_DerPreprocessor_73) 0)) (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_73 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) v_DerPreprocessor_71) v_DerPreprocessor_73) 0)))) (or .cse17 (not (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)) .cse18 (and (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) 0) 0) 0)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) 0) 0) 0))))))) (or (not (= .cse19 |c_ULTIMATE.start_main_~head~0#1.base|)) (and .cse0 .cse1) (and (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse19 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_75) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse19 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_75))) (select (store .cse20 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse19 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse21 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse21) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse21 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (store .cse10 .cse3 (select .cse22 .cse3)) .cse22)) (not (= .cse21 v_DerPreprocessor_59)) (not (= v_DerPreprocessor_60 .cse22)) (= .cse21 0))))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse23) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse23 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (store .cse10 .cse3 (select .cse24 .cse3)) .cse24)) (not (= .cse23 v_DerPreprocessor_59)) (not (= v_DerPreprocessor_60 .cse24)) (= .cse23 0))))) (or .cse0 (and (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_493 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse25) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse25 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (store .cse10 .cse3 (select .cse26 .cse3)) .cse26)) (not (= .cse25 v_DerPreprocessor_59)) (not (= v_DerPreprocessor_60 .cse26)))))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_60) v_DerPreprocessor_59 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_481 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse27 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse27) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_481)) .cse27 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (store .cse10 .cse3 (select .cse28 .cse3)) .cse28)) (not (= .cse27 v_DerPreprocessor_59)) (not (= v_DerPreprocessor_60 .cse28)))))))))))) is different from false [2023-11-12 00:10:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-12 00:10:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490195340] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:10:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [20659441] [2023-11-12 00:10:44,651 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:10:44,651 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:10:44,652 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:10:44,652 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:10:44,652 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs