./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 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_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 14:41:07,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:41:07,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:41:07,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:41:07,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:41:07,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:41:07,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:41:07,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:41:07,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:41:07,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:41:07,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:41:07,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:41:07,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:41:07,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:41:07,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:41:07,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:41:07,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:41:07,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:41:07,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:41:07,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:41:07,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:41:07,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:41:07,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:41:07,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:41:07,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:41:07,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:41:07,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:41:07,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:41:07,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:41:07,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:41:07,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:41:07,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:41:07,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:41:07,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:41:07,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:41:07,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:41:07,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:41:07,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:41:07,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:41:07,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:41:07,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:41:07,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-23 14:41:07,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:41:07,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:41:07,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:41:07,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:41:07,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:41:07,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:41:07,669 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:41:07,670 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:41:07,670 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:41:07,670 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:41:07,670 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:41:07,670 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:41:07,671 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:41:07,671 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:41:07,671 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:41:07,671 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:41:07,672 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:41:07,672 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:41:07,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:41:07,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:41:07,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:41:07,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:41:07,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:41:07,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:41:07,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:41:07,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:41:07,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:41:07,675 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 14:41:07,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:41:07,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:41:07,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:41:07,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:41:07,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:41:07,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:41:07,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:41:07,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:41:07,677 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:41:07,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:41:07,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:41:07,678 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:41:07,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:41:07,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:41:07,678 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:41:07,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/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_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-23 14:41:08,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:41:08,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:41:08,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:41:08,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:41:08,062 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:41:08,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-23 14:41:11,819 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:41:12,171 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:41:12,172 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-23 14:41:12,186 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/data/52c3f30a2/b883303f63714b6bba6ee00e97163207/FLAGd60e7b4d2 [2022-11-23 14:41:12,207 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/data/52c3f30a2/b883303f63714b6bba6ee00e97163207 [2022-11-23 14:41:12,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:41:12,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:41:12,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:41:12,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:41:12,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:41:12,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afb4858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12, skipping insertion in model container [2022-11-23 14:41:12,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:41:12,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:41:12,688 WARN L237 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_d75952b7-85ec-416d-9608-cd0c26c259e5/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-23 14:41:12,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:41:12,701 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:41:12,803 WARN L237 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_d75952b7-85ec-416d-9608-cd0c26c259e5/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-23 14:41:12,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:41:12,854 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:41:12,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12 WrapperNode [2022-11-23 14:41:12,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:41:12,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:41:12,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:41:12,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:41:12,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,943 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-11-23 14:41:12,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:41:12,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:41:12,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:41:12,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:41:12,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:12,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:13,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:13,018 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:13,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:13,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:41:13,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:41:13,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:41:13,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:41:13,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (1/1) ... [2022-11-23 14:41:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:41:13,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:41:13,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:41:13,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:41:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:41:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:41:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 14:41:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 14:41:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:41:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:41:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:41:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:41:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:41:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:41:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:41:13,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:41:13,341 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:41:13,344 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:41:13,795 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:41:13,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:41:13,884 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 14:41:13,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:13 BoogieIcfgContainer [2022-11-23 14:41:13,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:41:13,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:41:13,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:41:13,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:41:13,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:41:12" (1/3) ... [2022-11-23 14:41:13,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353ce43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:41:13, skipping insertion in model container [2022-11-23 14:41:13,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:12" (2/3) ... [2022-11-23 14:41:13,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353ce43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:41:13, skipping insertion in model container [2022-11-23 14:41:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:13" (3/3) ... [2022-11-23 14:41:13,904 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-23 14:41:13,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:41:13,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 14:41:14,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:41:14,021 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60d2a86d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:41:14,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-23 14:41:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:41:14,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:14,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:14,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -347856173, now seen corresponding path program 1 times [2022-11-23 14:41:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315497012] [2022-11-23 14:41:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:41:14,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315497012] [2022-11-23 14:41:14,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315497012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:14,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:41:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910566654] [2022-11-23 14:41:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:14,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:41:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:41:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:14,749 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:41:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:14,873 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-23 14:41:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:41:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-23 14:41:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:14,887 INFO L225 Difference]: With dead ends: 105 [2022-11-23 14:41:14,887 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 14:41:14,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:14,897 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:14,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 14:41:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-11-23 14:41:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-23 14:41:14,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2022-11-23 14:41:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:14,956 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-23 14:41:14,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:41:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-23 14:41:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:41:14,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:14,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:14,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:41:14,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1398975318, now seen corresponding path program 1 times [2022-11-23 14:41:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666126906] [2022-11-23 14:41:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:41:15,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666126906] [2022-11-23 14:41:15,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666126906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:15,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:15,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:41:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587985430] [2022-11-23 14:41:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:41:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:41:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:15,274 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:15,393 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-11-23 14:41:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:41:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-11-23 14:41:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:15,396 INFO L225 Difference]: With dead ends: 57 [2022-11-23 14:41:15,396 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 14:41:15,397 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 [2022-11-23 14:41:15,399 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:15,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 14:41:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-23 14:41:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:41:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-23 14:41:15,415 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2022-11-23 14:41:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:15,416 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-23 14:41:15,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-23 14:41:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 14:41:15,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:15,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:41:15,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1489002484, now seen corresponding path program 1 times [2022-11-23 14:41:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360235307] [2022-11-23 14:41:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:15,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:15,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360235307] [2022-11-23 14:41:15,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360235307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:15,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:15,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:41:15,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513481893] [2022-11-23 14:41:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:15,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:41:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:41:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:15,550 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:15,611 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-23 14:41:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:41:15,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-23 14:41:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:15,613 INFO L225 Difference]: With dead ends: 55 [2022-11-23 14:41:15,613 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:41:15,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:15,616 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:15,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:41:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-23 14:41:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:41:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-23 14:41:15,625 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2022-11-23 14:41:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:15,626 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-23 14:41:15,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-23 14:41:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:41:15,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:15,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:15,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:41:15,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 450833552, now seen corresponding path program 1 times [2022-11-23 14:41:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:15,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709434841] [2022-11-23 14:41:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:15,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709434841] [2022-11-23 14:41:15,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709434841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:15,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:15,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:41:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302558466] [2022-11-23 14:41:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:15,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:41:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:41:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:15,788 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:15,883 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-23 14:41:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:41:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-23 14:41:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:15,885 INFO L225 Difference]: With dead ends: 69 [2022-11-23 14:41:15,885 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:41:15,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:15,887 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:15,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:41:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-11-23 14:41:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:41:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-23 14:41:15,896 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-11-23 14:41:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:15,897 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-23 14:41:15,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-23 14:41:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:41:15,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:15,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:41:15,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1090938302, now seen corresponding path program 1 times [2022-11-23 14:41:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061463226] [2022-11-23 14:41:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:16,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061463226] [2022-11-23 14:41:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061463226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:16,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:16,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:41:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799597057] [2022-11-23 14:41:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:16,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:41:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:41:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:16,102 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:16,219 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-23 14:41:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:41:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-23 14:41:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:16,224 INFO L225 Difference]: With dead ends: 76 [2022-11-23 14:41:16,224 INFO L226 Difference]: Without dead ends: 74 [2022-11-23 14:41:16,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:16,232 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:16,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-23 14:41:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2022-11-23 14:41:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:41:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-23 14:41:16,245 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 20 [2022-11-23 14:41:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:16,245 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-23 14:41:16,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-23 14:41:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:41:16,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:16,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:16,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:41:16,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1668340695, now seen corresponding path program 1 times [2022-11-23 14:41:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898245357] [2022-11-23 14:41:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:41:16,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898245357] [2022-11-23 14:41:16,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898245357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:41:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913615600] [2022-11-23 14:41:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:41:16,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:41:16,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:41:16,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:41:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:16,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:41:16,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:41:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:41:16,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:41:16,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913615600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:16,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:41:16,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 14:41:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864967220] [2022-11-23 14:41:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:16,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:41:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:41:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:41:16,844 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:41:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:16,925 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-11-23 14:41:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:41:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-11-23 14:41:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:16,928 INFO L225 Difference]: With dead ends: 96 [2022-11-23 14:41:16,928 INFO L226 Difference]: Without dead ends: 49 [2022-11-23 14:41:16,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:41:16,936 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:16,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-23 14:41:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-23 14:41:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-23 14:41:16,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2022-11-23 14:41:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:16,958 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-23 14:41:16,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:41:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-23 14:41:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:41:16,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:16,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:16,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:41:17,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 14:41:17,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:17,169 INFO L85 PathProgramCache]: Analyzing trace with hash 419694547, now seen corresponding path program 1 times [2022-11-23 14:41:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:17,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452493506] [2022-11-23 14:41:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:17,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:17,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452493506] [2022-11-23 14:41:17,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452493506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:17,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:17,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:41:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346693700] [2022-11-23 14:41:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:17,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:41:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:17,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:41:17,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:41:17,318 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:17,405 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-11-23 14:41:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:41:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 14:41:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:17,407 INFO L225 Difference]: With dead ends: 49 [2022-11-23 14:41:17,408 INFO L226 Difference]: Without dead ends: 48 [2022-11-23 14:41:17,408 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 [2022-11-23 14:41:17,409 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:17,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-23 14:41:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-23 14:41:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-23 14:41:17,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-11-23 14:41:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:17,431 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-23 14:41:17,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-23 14:41:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:41:17,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:17,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:41:17,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 419690784, now seen corresponding path program 1 times [2022-11-23 14:41:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:17,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150948186] [2022-11-23 14:41:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:17,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150948186] [2022-11-23 14:41:17,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150948186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:17,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:41:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258648182] [2022-11-23 14:41:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:17,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:41:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:41:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:17,555 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:17,627 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-11-23 14:41:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:41:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 14:41:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:17,630 INFO L225 Difference]: With dead ends: 48 [2022-11-23 14:41:17,630 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 14:41:17,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:17,632 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:17,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 14:41:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-23 14:41:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-23 14:41:17,652 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 22 [2022-11-23 14:41:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:17,652 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-23 14:41:17,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-23 14:41:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:41:17,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:17,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:17,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:41:17,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 125629172, now seen corresponding path program 1 times [2022-11-23 14:41:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:17,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036928869] [2022-11-23 14:41:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:17,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:17,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036928869] [2022-11-23 14:41:17,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036928869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:17,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:17,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:41:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335068300] [2022-11-23 14:41:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:17,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:41:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:17,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:41:17,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:41:17,861 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:17,974 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-23 14:41:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:41:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-23 14:41:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:17,975 INFO L225 Difference]: With dead ends: 57 [2022-11-23 14:41:17,975 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 14:41:17,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:41:17,976 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:17,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 64 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 14:41:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2022-11-23 14:41:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-23 14:41:17,982 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2022-11-23 14:41:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:17,982 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-23 14:41:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-23 14:41:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:41:17,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:17,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:41:17,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash 125512507, now seen corresponding path program 1 times [2022-11-23 14:41:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298898881] [2022-11-23 14:41:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:18,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298898881] [2022-11-23 14:41:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298898881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:41:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733866653] [2022-11-23 14:41:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:18,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:41:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:18,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:41:18,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:41:18,127 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:18,315 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-23 14:41:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:41:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-23 14:41:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:18,319 INFO L225 Difference]: With dead ends: 61 [2022-11-23 14:41:18,319 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 14:41:18,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:41:18,321 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:18,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 74 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 14:41:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-11-23 14:41:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-23 14:41:18,343 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 23 [2022-11-23 14:41:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:18,344 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-23 14:41:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-23 14:41:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 14:41:18,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:18,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:18,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:41:18,346 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 210389729, now seen corresponding path program 1 times [2022-11-23 14:41:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:18,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867125901] [2022-11-23 14:41:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:41:18,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:18,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867125901] [2022-11-23 14:41:18,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867125901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:18,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:18,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:41:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899510522] [2022-11-23 14:41:18,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:18,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:41:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:18,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:41:18,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:41:18,517 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:18,642 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-23 14:41:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:41:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-23 14:41:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:18,646 INFO L225 Difference]: With dead ends: 89 [2022-11-23 14:41:18,646 INFO L226 Difference]: Without dead ends: 61 [2022-11-23 14:41:18,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:41:18,647 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:18,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:41:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-23 14:41:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-11-23 14:41:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-23 14:41:18,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2022-11-23 14:41:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:18,663 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-23 14:41:18,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-23 14:41:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:41:18,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:18,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:41:18,666 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 343892484, now seen corresponding path program 1 times [2022-11-23 14:41:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:18,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798328449] [2022-11-23 14:41:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:18,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798328449] [2022-11-23 14:41:18,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798328449] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:41:18,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902730424] [2022-11-23 14:41:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:41:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:41:18,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:41:18,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:41:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:19,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:41:19,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:41:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:19,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:41:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:19,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902730424] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:41:19,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683075811] [2022-11-23 14:41:19,438 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:41:19,438 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:41:19,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:41:19,449 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:41:19,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:41:19,583 INFO L350 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 12 treesize of output 9 [2022-11-23 14:41:19,590 INFO L350 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 6 treesize of output 5 [2022-11-23 14:41:19,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 14:41:19,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:41:19,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:19,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:41:20,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:41:20,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:20,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:20,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:20,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:20,274 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,277 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:41:20,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:20,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:20,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:20,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:20,649 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,672 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,676 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:20,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:20,804 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:41:20,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-23 14:41:20,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:20,849 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:41:20,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-23 14:41:20,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:20,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-23 14:41:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,123 INFO L350 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 35 treesize of output 7 [2022-11-23 14:41:21,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:21,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,137 INFO L350 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 29 treesize of output 17 [2022-11-23 14:41:21,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,159 INFO L350 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 29 treesize of output 17 [2022-11-23 14:41:21,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:21,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:21,618 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-23 14:41:21,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 329 treesize of output 339 [2022-11-23 14:41:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:21,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:21,793 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-23 14:41:21,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 323 [2022-11-23 14:41:25,252 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:41:25,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 255 [2022-11-23 14:41:25,307 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:41:25,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 251 [2022-11-23 14:41:25,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:26,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:26,067 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:41:26,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 257 [2022-11-23 14:41:26,122 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:41:26,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 253 [2022-11-23 14:41:26,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:41:26,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:26,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:26,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:26,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:26,920 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:26,922 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:26,926 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:26,932 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:27,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:27,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:27,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:27,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:27,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:41:27,270 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:27,273 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:27,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:27,311 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-23 14:41:27,543 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:41:34,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [683075811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:34,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:41:34,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [7, 7, 7] total 26 [2022-11-23 14:41:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583979637] [2022-11-23 14:41:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:41:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:41:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-11-23 14:41:34,481 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:36,937 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-23 14:41:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 14:41:36,939 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-23 14:41:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:36,940 INFO L225 Difference]: With dead ends: 59 [2022-11-23 14:41:36,940 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 14:41:36,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-11-23 14:41:36,941 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:36,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 112 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 14:41:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 14:41:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-23 14:41:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-23 14:41:36,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-11-23 14:41:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:36,955 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-23 14:41:36,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-23 14:41:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:41:36,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:36,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:36,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:41:37,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 14:41:37,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1715193239, now seen corresponding path program 1 times [2022-11-23 14:41:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765411641] [2022-11-23 14:41:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:41:37,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:37,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765411641] [2022-11-23 14:41:37,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765411641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:41:37,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:41:37,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:41:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307639607] [2022-11-23 14:41:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:41:37,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:41:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:41:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:41:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:37,302 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:41:37,353 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-23 14:41:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:41:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-23 14:41:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:41:37,356 INFO L225 Difference]: With dead ends: 45 [2022-11-23 14:41:37,356 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 14:41:37,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:41:37,358 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:41:37,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:41:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 14:41:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-23 14:41:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:41:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-23 14:41:37,372 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-11-23 14:41:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:41:37,373 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-23 14:41:37,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:41:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-23 14:41:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:41:37,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:41:37,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:41:37,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:41:37,378 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:41:37,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:41:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1631382992, now seen corresponding path program 1 times [2022-11-23 14:41:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:41:37,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626551673] [2022-11-23 14:41:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:41:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:37,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:41:37,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626551673] [2022-11-23 14:41:37,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626551673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:41:37,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662088531] [2022-11-23 14:41:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:41:37,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:41:37,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:41:37,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:41:37,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:41:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:41:37,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:41:37,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:41:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:37,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:41:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:41:38,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662088531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:41:38,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732755319] [2022-11-23 14:41:38,054 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-23 14:41:38,055 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:41:38,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:41:38,055 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:41:38,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:41:38,122 INFO L350 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 6 treesize of output 5 [2022-11-23 14:41:38,127 INFO L350 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 12 treesize of output 9 [2022-11-23 14:41:38,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:41:38,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 14:41:38,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:41:38,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:38,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:38,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:38,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:41:38,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:38,631 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,633 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,635 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,638 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:38,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:38,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:41:38,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:38,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:38,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:38,909 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,911 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,913 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:38,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,007 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:41:39,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-23 14:41:39,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,040 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:41:39,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-23 14:41:39,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-23 14:41:39,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,188 INFO L350 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 35 treesize of output 7 [2022-11-23 14:41:39,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,199 INFO L350 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 29 treesize of output 17 [2022-11-23 14:41:39,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:39,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,216 INFO L350 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 29 treesize of output 17 [2022-11-23 14:41:39,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:39,597 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-23 14:41:39,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 329 treesize of output 347 [2022-11-23 14:41:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:39,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:41:39,727 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-23 14:41:39,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 315 [2022-11-23 14:41:41,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:50,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:50,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:41:50,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:41:51,265 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:41:51,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:41:51,302 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:41:51,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:41:51,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:41:52,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:52,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:52,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:41:52,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:41:52,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:52,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:41:52,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:52,447 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,452 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,454 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:41:52,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:52,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:41:52,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:52,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:41:52,741 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:41:52,786 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-23 14:41:52,966 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:42:00,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1732755319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:42:00,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:42:00,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-11-23 14:42:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247802378] [2022-11-23 14:42:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:42:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 14:42:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:42:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 14:42:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-11-23 14:42:00,341 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:42:04,394 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-11-23 14:42:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:42:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-23 14:42:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:42:04,395 INFO L225 Difference]: With dead ends: 69 [2022-11-23 14:42:04,395 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 14:42:04,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 14:42:04,397 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:42:04,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 85 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 14:42:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 14:42:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-11-23 14:42:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-23 14:42:04,412 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 35 [2022-11-23 14:42:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:42:04,413 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-23 14:42:04,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-23 14:42:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 14:42:04,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:42:04,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:42:04,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:42:04,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:42:04,621 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:42:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:42:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1319076715, now seen corresponding path program 1 times [2022-11-23 14:42:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:42:04,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235679452] [2022-11-23 14:42:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:42:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:42:04,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:42:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235679452] [2022-11-23 14:42:04,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235679452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:42:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955000448] [2022-11-23 14:42:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:04,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:42:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:42:04,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:42:04,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:42:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:05,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:42:05,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:42:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:42:05,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:42:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:42:05,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955000448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:42:05,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730628363] [2022-11-23 14:42:05,228 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-23 14:42:05,229 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:42:05,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:42:05,230 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:42:05,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:42:05,292 INFO L350 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 12 treesize of output 9 [2022-11-23 14:42:05,297 INFO L350 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 6 treesize of output 5 [2022-11-23 14:42:05,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:05,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 14:42:05,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:05,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:05,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:05,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:05,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:05,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:05,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:05,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:05,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:05,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:05,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:05,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-23 14:42:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,770 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:42:05,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 334 [2022-11-23 14:42:05,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:05,820 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:42:05,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 246 [2022-11-23 14:42:05,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2022-11-23 14:42:05,888 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-23 14:42:05,888 INFO L350 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 2 case distinctions, treesize of input 65 treesize of output 38 [2022-11-23 14:42:05,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:05,901 INFO L350 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 38 treesize of output 28 [2022-11-23 14:42:06,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:06,121 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:06,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:06,139 INFO L350 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 35 treesize of output 7 [2022-11-23 14:42:06,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:06,151 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:06,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:06,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:06,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:06,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:06,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:06,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:07,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:07,056 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:42:07,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:42:07,093 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:42:07,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:42:07,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:07,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:07,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:07,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:07,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:07,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:07,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:07,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:07,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:07,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:07,880 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-23 14:42:08,084 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:42:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1730628363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:42:14,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:42:14,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-11-23 14:42:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568048527] [2022-11-23 14:42:14,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:42:14,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 14:42:14,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:42:14,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 14:42:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-11-23 14:42:14,482 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:42:18,224 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-23 14:42:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:42:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-23 14:42:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:42:18,226 INFO L225 Difference]: With dead ends: 61 [2022-11-23 14:42:18,226 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 14:42:18,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 14:42:18,228 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:42:18,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 97 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 14:42:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 14:42:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-11-23 14:42:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-23 14:42:18,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2022-11-23 14:42:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:42:18,245 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-23 14:42:18,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-23 14:42:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 14:42:18,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:42:18,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:42:18,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:42:18,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:42:18,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:42:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:42:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1318989094, now seen corresponding path program 1 times [2022-11-23 14:42:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:42:18,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119456567] [2022-11-23 14:42:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:42:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:42:18,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:42:18,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119456567] [2022-11-23 14:42:18,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119456567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:42:18,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:42:18,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:42:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621319126] [2022-11-23 14:42:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:42:18,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:42:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:42:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:42:18,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:42:18,535 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:42:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:42:18,617 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-23 14:42:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:42:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-11-23 14:42:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:42:18,619 INFO L225 Difference]: With dead ends: 48 [2022-11-23 14:42:18,619 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 14:42:18,620 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 [2022-11-23 14:42:18,620 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:42:18,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:42:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 14:42:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-23 14:42:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-23 14:42:18,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 38 [2022-11-23 14:42:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:42:18,637 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-23 14:42:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:42:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-23 14:42:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 14:42:18,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:42:18,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:42:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 14:42:18,639 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:42:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:42:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2061011198, now seen corresponding path program 1 times [2022-11-23 14:42:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:42:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830747124] [2022-11-23 14:42:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:42:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:42:18,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:42:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830747124] [2022-11-23 14:42:18,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830747124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:42:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556689747] [2022-11-23 14:42:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:18,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:42:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:42:18,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:42:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:42:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:19,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:42:19,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:42:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:42:19,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:42:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:42:19,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556689747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:42:19,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142695074] [2022-11-23 14:42:19,233 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 14:42:19,234 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:42:19,234 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:42:19,234 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:42:19,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:42:19,281 INFO L350 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 12 treesize of output 9 [2022-11-23 14:42:19,287 INFO L350 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 6 treesize of output 5 [2022-11-23 14:42:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:19,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:19,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 14:42:19,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:19,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:19,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:19,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:19,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:19,657 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,659 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,662 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,663 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:19,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:42:19,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:19,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:19,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:19,906 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,908 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,911 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:19,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:19,968 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:42:19,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-23 14:42:19,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,002 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:42:20,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-23 14:42:20,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-23 14:42:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,122 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:20,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,147 INFO L350 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 35 treesize of output 7 [2022-11-23 14:42:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:20,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,160 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:20,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:20,487 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-23 14:42:20,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 328 treesize of output 346 [2022-11-23 14:42:20,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:20,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:20,603 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-23 14:42:20,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 314 [2022-11-23 14:42:21,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:25,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:25,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:42:25,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:25,784 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:42:25,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 245 [2022-11-23 14:42:25,820 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:42:25,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 245 [2022-11-23 14:42:25,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:42:26,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:26,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:26,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:26,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:26,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:26,977 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:26,979 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:26,981 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:27,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:27,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:27,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:27,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:27,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:27,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:42:27,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:27,200 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:27,203 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:27,205 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:27,235 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-23 14:42:27,404 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:42:36,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2142695074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:42:36,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:42:36,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 32 [2022-11-23 14:42:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561939246] [2022-11-23 14:42:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:42:36,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:42:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:42:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:42:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:42:36,778 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:42:41,457 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-23 14:42:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:42:41,457 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-23 14:42:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:42:41,458 INFO L225 Difference]: With dead ends: 63 [2022-11-23 14:42:41,458 INFO L226 Difference]: Without dead ends: 61 [2022-11-23 14:42:41,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 14:42:41,460 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 102 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:42:41,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 96 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 14:42:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-23 14:42:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-23 14:42:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-23 14:42:41,481 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2022-11-23 14:42:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:42:41,482 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-23 14:42:41,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:42:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-23 14:42:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 14:42:41,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:42:41,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:42:41,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:42:41,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 14:42:41,691 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:42:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:42:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1796103701, now seen corresponding path program 1 times [2022-11-23 14:42:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:42:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068123115] [2022-11-23 14:42:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:42:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:42:41,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:42:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068123115] [2022-11-23 14:42:41,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068123115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:42:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813994212] [2022-11-23 14:42:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:42:41,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:42:41,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:42:41,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:42:41,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:42:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:42:42,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:42:42,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:42:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:42:42,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:42:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:42:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813994212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:42:42,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538735249] [2022-11-23 14:42:42,308 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 14:42:42,309 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:42:42,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:42:42,309 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:42:42,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:42:42,361 INFO L350 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 12 treesize of output 9 [2022-11-23 14:42:42,366 INFO L350 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 6 treesize of output 5 [2022-11-23 14:42:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 14:42:42,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-23 14:42:42,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:42,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:42,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:42,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:42:42,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:42,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:42:42,760 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:42,762 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:42,764 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:42,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:42,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:43,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:42:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:42:43,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:42:43,040 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:43,043 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:43,046 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:42:43,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-23 14:42:43,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,222 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:42:43,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 339 [2022-11-23 14:42:43,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,271 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:42:43,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 241 [2022-11-23 14:42:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-23 14:42:43,345 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 14:42:43,345 INFO L350 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 2 case distinctions, treesize of input 49 treesize of output 26 [2022-11-23 14:42:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,357 INFO L350 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 26 treesize of output 16 [2022-11-23 14:42:43,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,607 INFO L350 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 35 treesize of output 7 [2022-11-23 14:42:43,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,620 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:43,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,632 INFO L350 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 29 treesize of output 17 [2022-11-23 14:42:43,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:43,935 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-23 14:42:43,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 329 treesize of output 347 [2022-11-23 14:42:43,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:42:43,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:42:44,040 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-23 14:42:44,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 315 [2022-11-23 14:42:47,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:43:01,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:43:01,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:43:01,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:43:02,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:43:02,289 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:43:02,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-23 14:43:02,336 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:43:02,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-23 14:43:04,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:43:04,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:43:04,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-23 14:43:04,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:43:04,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:43:04,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,392 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,395 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:43:04,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:43:04,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:43:04,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2022-11-23 14:43:04,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:43:04,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:43:04,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:43:04,680 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,682 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,685 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,687 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:43:04,725 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-23 14:43:04,883 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:43:15,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [538735249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:43:15,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:43:15,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 35 [2022-11-23 14:43:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389893442] [2022-11-23 14:43:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:43:15,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 14:43:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:43:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 14:43:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 14:43:15,709 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:43:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:43:26,291 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-23 14:43:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 14:43:26,292 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-23 14:43:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:43:26,293 INFO L225 Difference]: With dead ends: 56 [2022-11-23 14:43:26,293 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 14:43:26,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 14:43:26,295 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:43:26,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 14:43:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 14:43:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 14:43:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-11-23 14:43:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 14:43:26,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-23 14:43:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:43:26,297 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 14:43:26,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:43:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 14:43:26,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 14:43:26,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-23 14:43:26,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-23 14:43:26,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-23 14:43:26,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-23 14:43:26,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-23 14:43:26,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-23 14:43:26,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-23 14:43:26,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-23 14:43:26,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-23 14:43:26,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-23 14:43:26,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-23 14:43:26,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-23 14:43:26,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-23 14:43:26,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-23 14:43:26,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-23 14:43:26,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-23 14:43:26,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-23 14:43:26,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-23 14:43:26,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:43:26,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 14:43:26,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 14:43:33,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-23 14:43:33,196 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-23 14:43:33,197 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 4) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (= (select .cse2 0) 48) (= 27 (select |#length| 2)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 0) 0) (= (select .cse2 1) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-23 14:43:33,197 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-11-23 14:43:33,197 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,198 INFO L899 garLoopResultBuilder]: For program point L631-5(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,199 INFO L899 garLoopResultBuilder]: For program point L631-6(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,199 INFO L895 garLoopResultBuilder]: At program point L631-7(lines 631 634) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse15 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse18 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse19 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse7 .cse8 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3) .cse9 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse10 .cse11 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1) .cse12 .cse13 .cse14 (<= |ULTIMATE.start_main_~new_data~0#1| 3) .cse15 .cse16 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3) .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and .cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse21) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse21) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse19 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse20)))) [2022-11-23 14:43:33,199 INFO L899 garLoopResultBuilder]: For program point L631-8(lines 631 634) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-11-23 14:43:33,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-23 14:43:33,201 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,202 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-23 14:43:33,202 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,202 INFO L899 garLoopResultBuilder]: For program point L635-5(line 635) no Hoare annotation was computed. [2022-11-23 14:43:33,202 INFO L895 garLoopResultBuilder]: At program point L635-6(lines 635 640) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-23 14:43:33,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-23 14:43:33,203 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-23 14:43:33,203 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-23 14:43:33,203 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-23 14:43:33,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 14:43:33,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-23 14:43:33,204 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-11-23 14:43:33,204 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-11-23 14:43:33,204 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-11-23 14:43:33,204 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-11-23 14:43:33,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-23 14:43:33,205 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse9 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse12 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) .cse9 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) .cse8 .cse9 .cse10 .cse11 (< 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse12))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (let ((.cse14 (+ |ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse13 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| .cse14) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 0 .cse14)))) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-23 14:43:33,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-23 14:43:33,206 INFO L895 garLoopResultBuilder]: At program point L637(lines 637 639) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647)) (.cse1 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648))) (.cse10 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse11 (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse13 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse14 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse18 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3)) (.cse19 (= |ULTIMATE.start_main_#t~ret17#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse22 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1)) (.cse25 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse26 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse27 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse28 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse29 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse30 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse31 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse32 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse8 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse34 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse35 (= |#NULL.base| 0)) (.cse36 (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse37 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (< 0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse27 .cse28 .cse29 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) .cse12 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_main_~len~0#1| .cse8) .cse34 .cse35 .cse36 .cse37))) [2022-11-23 14:43:33,206 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-23 14:43:33,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-23 14:43:33,207 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) .cse1 (= (select .cse2 4) 0) (= (select |#valid| 0) 0) .cse3 (= (select |#valid| 2) 1) .cse4 .cse5 (= (select .cse6 0) 48) (= 27 (select |#length| 2)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse2 0) 0) (= (select .cse6 1) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse1 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse8))) [2022-11-23 14:43:33,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-23 14:43:33,207 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse15 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3)) (.cse16 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse18 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1)) (.cse21 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse24 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse11 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse23 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (.cse27 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse25 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse26 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse28 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse29 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse30 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse32 .cse33 .cse34) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 (let ((.cse35 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|))) (or (and .cse0 .cse2 .cse8 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) .cse10 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) .cse35 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (and .cse0 .cse1 .cse2 .cse8 .cse10 .cse35 .cse11 .cse23 .cse27))) (<= 3 |ULTIMATE.start_main_~expected~0#1|) .cse25 .cse26 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-23 14:43:33,208 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-23 14:43:33,208 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-23 14:43:33,211 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse4 (not (= |#NULL.base| 0)))) (and (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|)) (.cse3 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 1)) (not (= (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8) |node_create_#in~data#1|)) (not (= (select .cse2 0) 0)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 12)) (not (= (select .cse2 4) 0)) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|)) (not (= (select .cse3 0) 0)) (not (= (select .cse3 4) 0)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 0)))) .cse4) (let ((.cse5 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse4 (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse5 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse5 1) 0)))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-23 14:43:33,211 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-23 14:43:33,215 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:43:33,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:43:33,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,263 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:43:33 BoogieIcfgContainer [2022-11-23 14:43:33,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:43:33,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:43:33,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:43:33,291 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:43:33,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:13" (3/4) ... [2022-11-23 14:43:33,295 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 14:43:33,301 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-23 14:43:33,309 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-23 14:43:33,319 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-23 14:43:33,319 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 14:43:33,320 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 14:43:33,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && i <= 0) && 0 <= i + 2147483648) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= unknown-#in~data-unknown) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \result <= 0) && unknown-#in~len-unknown <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && 0 <= head) && \result == head) && #NULL == 0) [2022-11-23 14:43:33,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && 0 <= i + 2147483648) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && i <= 1) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-23 14:43:33,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((unknown-#in~data-unknown == data && 0 <= s) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && unknown-#in~index-unknown == i) && unknown-#in~index-unknown == index) && head == #in~head) && len + i == new_data) && #in~head == head) && #in~head == s) && s == #in~head) && unknown-#in~data-unknown == new_data) || ((((((((((((((((unknown-#in~data-unknown == data && 0 <= s) && head == #memory_$Pointer$[#in~head][#in~head]) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && unknown-#in~index-unknown == index + 1) && unknown-#in~index-unknown == i) && len + i == new_data) && #in~head == s) && s == #in~head) && 0 < unknown-#in~index-unknown) && #memory_$Pointer$[#in~head][#in~head] == head) && unknown-#in~data-unknown == new_data)) && data == 1) && 1 <= unknown-#in~data-unknown) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && (((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && #memory_$Pointer$[last][last] == head) && len == i + 1) && \result == head) || (i <= 0 && 0 < i + 1))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-23 14:43:33,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && i <= 0) && 0 < i + 1) && len + i == expected) && #in~head <= 0) && s == #in~head) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && #in~head == head) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && head == #in~head) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && #in~head <= 0) || (((((((((((((((((((((((((((((1 <= len && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && (((((((((0 <= #in~head && 2 <= unknown-#in~len-unknown) && len + i == expected) && head == #memory_$Pointer$[#in~head][#in~head]) && s == #in~head) && unknown-#in~index-unknown == index + 1) && #in~head == s) && unknown-#in~index-unknown == i) && #memory_$Pointer$[#in~head][#in~head] == head) || ((((((((0 <= #in~head && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && len + i == expected) && s == #in~head) && #in~head == s) && unknown-#in~index-unknown == i) && #in~head == head) && head == #in~head))) && 3 <= expected) && new_data <= 3) && len <= 1) && unknown-#in~index-unknown <= 1) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && #in~head <= 0) [2022-11-23 14:43:33,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= #in~head) && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && index <= 0) && 0 < i + 1) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && #in~head <= 0) && s == #in~head) && #in~head == s) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && #in~head == head) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && head == #in~head) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && #in~head <= 0) || ((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && #in~head <= 0) && head == #memory_$Pointer$[#in~head][#in~head]) && s == #in~head) && unknown-#in~index-unknown == index + 1) && #in~head == s) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && #memory_$Pointer$[#in~head][#in~head] == head) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && #in~head <= 0) [2022-11-23 14:43:33,392 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:43:33,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:43:33,394 INFO L158 Benchmark]: Toolchain (without parser) took 141177.22ms. Allocated memory was 159.4MB in the beginning and 828.4MB in the end (delta: 669.0MB). Free memory was 113.3MB in the beginning and 393.2MB in the end (delta: -279.9MB). Peak memory consumption was 391.5MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,401 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 109.1MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:43:33,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.26ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 95.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.36ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,404 INFO L158 Benchmark]: Boogie Preprocessor took 72.80ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,404 INFO L158 Benchmark]: RCFGBuilder took 863.06ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 69.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,405 INFO L158 Benchmark]: TraceAbstraction took 139398.56ms. Allocated memory was 159.4MB in the beginning and 828.4MB in the end (delta: 669.0MB). Free memory was 68.6MB in the beginning and 397.4MB in the end (delta: -328.8MB). Peak memory consumption was 448.1MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,405 INFO L158 Benchmark]: Witness Printer took 102.03ms. Allocated memory is still 828.4MB. Free memory was 397.4MB in the beginning and 393.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:43:33,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 109.1MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.26ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 95.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.36ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.80ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 863.06ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 69.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 139398.56ms. Allocated memory was 159.4MB in the beginning and 828.4MB in the end (delta: 669.0MB). Free memory was 68.6MB in the beginning and 397.4MB in the end (delta: -328.8MB). Peak memory consumption was 448.1MB. Max. memory is 16.1GB. * Witness Printer took 102.03ms. Allocated memory is still 828.4MB. Free memory was 397.4MB in the beginning and 393.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 139.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 943 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 942 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3486 IncrementalHoareTripleChecker+Invalid, 3594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 442 mSDtfsCounter, 3486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 428 SyntacticMatches, 56 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 58.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 104 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 34 NumberOfFragments, 1613 HoareAnnotationTreeSize, 16 FomulaSimplifications, 123 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 24069 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 2097 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2084 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 203/222 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 56.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 178, DAG_INTERPRETER_EARLY_EXITS: 10, TOOLS_POST_APPLICATIONS: 388, TOOLS_POST_TIME: 47.2s, TOOLS_POST_CALL_APPLICATIONS: 40, TOOLS_POST_CALL_TIME: 3.4s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 2.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 453, TOOLS_QUANTIFIERELIM_TIME: 53.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 9.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 718, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 80, DOMAIN_JOIN_TIME: 1.5s, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.8s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 46, DOMAIN_ISSUBSETEQ_TIME: 0.2s, DOMAIN_ISBOTTOM_APPLICATIONS: 178, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 36.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 36.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 46, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.3s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 9213, DAG_COMPRESSION_RETAINED_NODES: 554, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2022-11-23 14:43:33,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((unknown-#in~data-unknown == data && 0 <= s) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && unknown-#in~index-unknown == i) && unknown-#in~index-unknown == index) && head == #in~head) && len + i == new_data) && #in~head == head) && #in~head == s) && s == #in~head) && unknown-#in~data-unknown == new_data) || ((((((((((((((((unknown-#in~data-unknown == data && 0 <= s) && head == #memory_$Pointer$[#in~head][#in~head]) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && unknown-#in~index-unknown == index + 1) && unknown-#in~index-unknown == i) && len + i == new_data) && #in~head == s) && s == #in~head) && 0 < unknown-#in~index-unknown) && #memory_$Pointer$[#in~head][#in~head] == head) && unknown-#in~data-unknown == new_data)) && data == 1) && 1 <= unknown-#in~data-unknown) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && (((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && #memory_$Pointer$[last][last] == head) && len == i + 1) && \result == head) || (i <= 0 && 0 < i + 1))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 637]: Loop Invariant [2022-11-23 14:43:33,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,444 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= #in~head) && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && index <= 0) && 0 < i + 1) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && #in~head <= 0) && s == #in~head) && #in~head == s) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && #in~head == head) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && head == #in~head) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && #in~head <= 0) || ((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && #in~head <= 0) && head == #memory_$Pointer$[#in~head][#in~head]) && s == #in~head) && unknown-#in~index-unknown == index + 1) && #in~head == s) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && #memory_$Pointer$[#in~head][#in~head] == head) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && #in~head <= 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && 0 <= i + 2147483648) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && i <= 1) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-11-23 14:43:33,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,458 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == unknown-#in~data-unknown) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && unknown-#in~len-unknown == len) && \valid[1] == 1) && data == 1) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= unknown-#in~len-unknown && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && len == 2) && #NULL == 0) && 1 <= data) && unknown-#in~len-unknown <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 631]: Loop Invariant [2022-11-23 14:43:33,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && i <= 0) && 0 <= i + 2147483648) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= unknown-#in~data-unknown) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \result <= 0) && unknown-#in~len-unknown <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && 0 <= head) && \result == head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant [2022-11-23 14:43:33,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:43:33,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:43:33,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((0 <= s && 0 <= #in~head) && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && 1 <= len) && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && i <= 0) && 0 < i + 1) && len + i == expected) && #in~head <= 0) && s == #in~head) && unknown-#in~index-unknown == i) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && #in~head == head) && unknown-#in~len-unknown <= 2) && new_data <= 3) && len <= 1) && head == #in~head) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && #in~head <= 0) || (((((((((((((((((((((((((((((1 <= len && head <= 0) && 0 <= last) && unknown-#in~data-unknown <= 1) && last <= 0) && #in~head <= 0) && index <= 0) && data == 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && unknown-#in~index-unknown <= 1) && 1 <= data) && \result <= 0) && unknown-#in~len-unknown <= 2) && (((((((((0 <= #in~head && 2 <= unknown-#in~len-unknown) && len + i == expected) && head == #memory_$Pointer$[#in~head][#in~head]) && s == #in~head) && unknown-#in~index-unknown == index + 1) && #in~head == s) && unknown-#in~index-unknown == i) && #memory_$Pointer$[#in~head][#in~head] == head) || ((((((((0 <= #in~head && unknown-#in~index-unknown == index) && 2 <= unknown-#in~len-unknown) && len + i == expected) && s == #in~head) && #in~head == s) && unknown-#in~index-unknown == i) && #in~head == head) && head == #in~head))) && 3 <= expected) && new_data <= 3) && len <= 1) && unknown-#in~index-unknown <= 1) && 0 <= #in~head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && #in~head <= 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-23 14:43:33,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d75952b7-85ec-416d-9608-cd0c26c259e5/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE