./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH --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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:49:49,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:49:49,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:49:49,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:49:49,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:49:49,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:49:49,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:49:49,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:49:49,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:49:49,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:49:49,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:49:49,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:49:49,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:49:49,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:49:49,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:49:49,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:49:49,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:49:49,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:49:49,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:49:49,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:49:49,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:49:49,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:49:49,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:49:49,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:49:49,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:49:49,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:49:49,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:49:49,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:49:49,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:49:49,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:49:49,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:49:49,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:49:49,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:49:49,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:49:49,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:49:49,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:49:49,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:49:49,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:49:49,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:49:49,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:49:49,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:49:49,213 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-03 04:49:49,259 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:49:49,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:49:49,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:49:49,261 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:49:49,261 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:49:49,261 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:49:49,262 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:49:49,262 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:49:49,262 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:49:49,262 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:49:49,263 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:49:49,264 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:49:49,264 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:49:49,264 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:49:49,264 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:49:49,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:49:49,265 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:49:49,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 04:49:49,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:49:49,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:49:49,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:49:49,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:49:49,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:49:49,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:49:49,267 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-03 04:49:49,268 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:49:49,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:49:49,268 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:49:49,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:49:49,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:49:49,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:49:49,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:49:49,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:49:49,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:49:49,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:49:49,272 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:49:49,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:49:49,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:49:49,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:49:49,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:49:49,273 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/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_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2021-11-03 04:49:49,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:49:49,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:49:49,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:49:49,540 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:49:49,541 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:49:49,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/recursive/Primes.c [2021-11-03 04:49:49,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/data/eb9904935/0f283cfdbafd4742b3a455e504886db6/FLAGa3e0e28ea [2021-11-03 04:49:50,000 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:49:50,001 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/sv-benchmarks/c/recursive/Primes.c [2021-11-03 04:49:50,007 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/data/eb9904935/0f283cfdbafd4742b3a455e504886db6/FLAGa3e0e28ea [2021-11-03 04:49:50,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/data/eb9904935/0f283cfdbafd4742b3a455e504886db6 [2021-11-03 04:49:50,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:49:50,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:49:50,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:49:50,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:49:50,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:49:50,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a74de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50, skipping insertion in model container [2021-11-03 04:49:50,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:49:50,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:49:50,622 WARN L228 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_bcaa0409-bb3f-4de1-a883-8fd90e547637/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-03 04:49:50,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:49:50,631 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:49:50,651 WARN L228 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_bcaa0409-bb3f-4de1-a883-8fd90e547637/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-03 04:49:50,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:49:50,664 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:49:50,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50 WrapperNode [2021-11-03 04:49:50,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:49:50,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:49:50,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:49:50,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:49:50,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:49:50,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:49:50,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:49:50,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:49:50,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:49:50,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:49:50,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:49:50,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:49:50,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (1/1) ... [2021-11-03 04:49:50,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:49:50,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:50,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:49:50,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:49:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2021-11-03 04:49:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2021-11-03 04:49:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-03 04:49:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-03 04:49:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2021-11-03 04:49:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2021-11-03 04:49:50,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:49:50,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:49:50,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:49:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:49:51,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:49:51,222 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-03 04:49:51,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:49:51 BoogieIcfgContainer [2021-11-03 04:49:51,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:49:51,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:49:51,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:49:51,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:49:51,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:49:50" (1/3) ... [2021-11-03 04:49:51,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c298cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:49:51, skipping insertion in model container [2021-11-03 04:49:51,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:49:50" (2/3) ... [2021-11-03 04:49:51,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c298cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:49:51, skipping insertion in model container [2021-11-03 04:49:51,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:49:51" (3/3) ... [2021-11-03 04:49:51,233 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2021-11-03 04:49:51,238 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:49:51,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-11-03 04:49:51,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:49:51,290 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:49:51,290 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-11-03 04:49:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:49:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-03 04:49:51,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:51,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-03 04:49:51,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 185888, now seen corresponding path program 1 times [2021-11-03 04:49:51,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:51,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016172927] [2021-11-03 04:49:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:51,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:51,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:51,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016172927] [2021-11-03 04:49:51,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016172927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:51,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:51,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:49:51,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478307314] [2021-11-03 04:49:51,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:49:51,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:51,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:49:51,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:49:51,559 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-11-03 04:49:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:51,592 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2021-11-03 04:49:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:49:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-03 04:49:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:51,602 INFO L225 Difference]: With dead ends: 81 [2021-11-03 04:49:51,602 INFO L226 Difference]: Without dead ends: 74 [2021-11-03 04:49:51,605 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:49:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-03 04:49:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-03 04:49:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 62 states have internal predecessors, (74), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-03 04:49:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2021-11-03 04:49:51,648 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 3 [2021-11-03 04:49:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:51,649 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2021-11-03 04:49:51,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-11-03 04:49:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2021-11-03 04:49:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-03 04:49:51,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:51,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-03 04:49:51,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:49:51,651 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 5762635, now seen corresponding path program 1 times [2021-11-03 04:49:51,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:51,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362479070] [2021-11-03 04:49:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:51,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:51,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:51,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362479070] [2021-11-03 04:49:51,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362479070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:51,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:51,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:49:51,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585005204] [2021-11-03 04:49:51,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:49:51,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:49:51,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:49:51,694 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-11-03 04:49:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:51,707 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2021-11-03 04:49:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:49:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-03 04:49:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:51,710 INFO L225 Difference]: With dead ends: 74 [2021-11-03 04:49:51,710 INFO L226 Difference]: Without dead ends: 73 [2021-11-03 04:49:51,711 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:49:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-03 04:49:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-03 04:49:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.553191489361702) internal successors, (73), 61 states have internal predecessors, (73), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-03 04:49:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2021-11-03 04:49:51,726 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 4 [2021-11-03 04:49:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:51,726 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2021-11-03 04:49:51,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-11-03 04:49:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2021-11-03 04:49:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 04:49:51,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:51,728 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:51,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:49:51,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -467491885, now seen corresponding path program 1 times [2021-11-03 04:49:51,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:51,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972771732] [2021-11-03 04:49:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:51,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:51,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:51,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972771732] [2021-11-03 04:49:51,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972771732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:51,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:51,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:49:51,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074675469] [2021-11-03 04:49:51,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:49:51,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:49:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:49:51,805 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:51,900 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2021-11-03 04:49:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:49:51,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-03 04:49:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:51,904 INFO L225 Difference]: With dead ends: 136 [2021-11-03 04:49:51,904 INFO L226 Difference]: Without dead ends: 68 [2021-11-03 04:49:51,906 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-03 04:49:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-11-03 04:49:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-03 04:49:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2021-11-03 04:49:51,934 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 14 [2021-11-03 04:49:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:51,934 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2021-11-03 04:49:51,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2021-11-03 04:49:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 04:49:51,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:51,936 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:51,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:49:51,937 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1607339527, now seen corresponding path program 1 times [2021-11-03 04:49:51,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:51,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481798945] [2021-11-03 04:49:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:51,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:52,096 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:52,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481798945] [2021-11-03 04:49:52,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481798945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:52,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:52,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:49:52,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438632254] [2021-11-03 04:49:52,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:49:52,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:52,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:49:52,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:49:52,110 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:52,353 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2021-11-03 04:49:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:49:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 04:49:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:52,356 INFO L225 Difference]: With dead ends: 85 [2021-11-03 04:49:52,356 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 04:49:52,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:49:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 04:49:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2021-11-03 04:49:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 67 states have internal predecessors, (82), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:49:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2021-11-03 04:49:52,381 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 15 [2021-11-03 04:49:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:52,383 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2021-11-03 04:49:52,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2021-11-03 04:49:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 04:49:52,386 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:52,386 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:52,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:49:52,387 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1712082262, now seen corresponding path program 1 times [2021-11-03 04:49:52,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:52,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078776571] [2021-11-03 04:49:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:52,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:52,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:52,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078776571] [2021-11-03 04:49:52,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078776571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:52,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:52,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:49:52,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151094481] [2021-11-03 04:49:52,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:49:52,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:49:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:49:52,464 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:52,495 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2021-11-03 04:49:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:49:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-03 04:49:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:52,501 INFO L225 Difference]: With dead ends: 85 [2021-11-03 04:49:52,501 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 04:49:52,502 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:49:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 04:49:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2021-11-03 04:49:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 66 states have internal predecessors, (80), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:49:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2021-11-03 04:49:52,523 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 16 [2021-11-03 04:49:52,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:52,524 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2021-11-03 04:49:52,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2021-11-03 04:49:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 04:49:52,525 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:52,525 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:52,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:49:52,526 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 665532417, now seen corresponding path program 1 times [2021-11-03 04:49:52,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:52,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902652559] [2021-11-03 04:49:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:52,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:52,633 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:52,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902652559] [2021-11-03 04:49:52,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902652559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:52,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:52,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:49:52,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941011822] [2021-11-03 04:49:52,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:49:52,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:49:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:52,651 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:52,697 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2021-11-03 04:49:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:49:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-11-03 04:49:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:52,700 INFO L225 Difference]: With dead ends: 109 [2021-11-03 04:49:52,700 INFO L226 Difference]: Without dead ends: 82 [2021-11-03 04:49:52,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:49:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-03 04:49:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-11-03 04:49:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 68 states have internal predecessors, (81), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-11-03 04:49:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2021-11-03 04:49:52,723 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 17 [2021-11-03 04:49:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:52,724 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2021-11-03 04:49:52,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2021-11-03 04:49:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 04:49:52,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:52,725 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:52,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:49:52,726 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1535160157, now seen corresponding path program 1 times [2021-11-03 04:49:52,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:52,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115186028] [2021-11-03 04:49:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:52,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:52,816 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:52,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115186028] [2021-11-03 04:49:52,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115186028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:52,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:52,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:49:52,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569765956] [2021-11-03 04:49:52,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:49:52,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:49:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:52,819 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:52,958 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2021-11-03 04:49:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:49:52,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-03 04:49:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:52,961 INFO L225 Difference]: With dead ends: 116 [2021-11-03 04:49:52,962 INFO L226 Difference]: Without dead ends: 113 [2021-11-03 04:49:52,962 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:49:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-03 04:49:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2021-11-03 04:49:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 89 states have internal predecessors, (110), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-03 04:49:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2021-11-03 04:49:52,982 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 17 [2021-11-03 04:49:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:52,983 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2021-11-03 04:49:52,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2021-11-03 04:49:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 04:49:52,984 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:52,984 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:52,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:49:52,985 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1355807845, now seen corresponding path program 1 times [2021-11-03 04:49:52,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:52,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739169578] [2021-11-03 04:49:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:52,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:53,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:53,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739169578] [2021-11-03 04:49:53,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739169578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:53,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:53,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:49:53,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902057685] [2021-11-03 04:49:53,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:49:53,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:49:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:49:53,069 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:53,140 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2021-11-03 04:49:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:49:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-03 04:49:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:53,146 INFO L225 Difference]: With dead ends: 148 [2021-11-03 04:49:53,147 INFO L226 Difference]: Without dead ends: 124 [2021-11-03 04:49:53,152 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-03 04:49:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2021-11-03 04:49:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.375) internal successors, (121), 97 states have internal predecessors, (121), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-03 04:49:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2021-11-03 04:49:53,183 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 18 [2021-11-03 04:49:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:53,183 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2021-11-03 04:49:53,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2021-11-03 04:49:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 04:49:53,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:53,185 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:53,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:49:53,185 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash 345324673, now seen corresponding path program 1 times [2021-11-03 04:49:53,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:53,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518617589] [2021-11-03 04:49:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:53,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:53,273 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:53,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518617589] [2021-11-03 04:49:53,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518617589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:53,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:53,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:49:53,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97270583] [2021-11-03 04:49:53,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:49:53,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:49:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:53,281 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:53,405 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2021-11-03 04:49:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:49:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-03 04:49:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:53,408 INFO L225 Difference]: With dead ends: 121 [2021-11-03 04:49:53,408 INFO L226 Difference]: Without dead ends: 120 [2021-11-03 04:49:53,412 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:49:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-03 04:49:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-11-03 04:49:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 97 states have internal predecessors, (119), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-03 04:49:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2021-11-03 04:49:53,451 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 18 [2021-11-03 04:49:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:53,451 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2021-11-03 04:49:53,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2021-11-03 04:49:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-03 04:49:53,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:53,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:53,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:49:53,457 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1556028481, now seen corresponding path program 1 times [2021-11-03 04:49:53,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:53,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232933429] [2021-11-03 04:49:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:53,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:53,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:53,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232933429] [2021-11-03 04:49:53,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232933429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:53,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:53,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:49:53,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978303803] [2021-11-03 04:49:53,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:49:53,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:49:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:49:53,521 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:53,593 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2021-11-03 04:49:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:49:53,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-03 04:49:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:53,598 INFO L225 Difference]: With dead ends: 142 [2021-11-03 04:49:53,598 INFO L226 Difference]: Without dead ends: 140 [2021-11-03 04:49:53,599 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:49:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-03 04:49:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2021-11-03 04:49:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 109 states have internal predecessors, (137), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-03 04:49:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2021-11-03 04:49:53,615 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 20 [2021-11-03 04:49:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:53,620 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2021-11-03 04:49:53,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2021-11-03 04:49:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 04:49:53,622 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:53,622 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:53,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:49:53,623 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2099076670, now seen corresponding path program 1 times [2021-11-03 04:49:53,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:53,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063446576] [2021-11-03 04:49:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:53,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:49:53,688 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:53,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063446576] [2021-11-03 04:49:53,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063446576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:53,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:53,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 04:49:53,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967849575] [2021-11-03 04:49:53,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:49:53,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:49:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:49:53,691 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:53,800 INFO L93 Difference]: Finished difference Result 241 states and 307 transitions. [2021-11-03 04:49:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:49:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-03 04:49:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:53,803 INFO L225 Difference]: With dead ends: 241 [2021-11-03 04:49:53,803 INFO L226 Difference]: Without dead ends: 127 [2021-11-03 04:49:53,805 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:49:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-03 04:49:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2021-11-03 04:49:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 103 states have internal predecessors, (127), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-03 04:49:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2021-11-03 04:49:53,815 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 21 [2021-11-03 04:49:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:53,816 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2021-11-03 04:49:53,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2021-11-03 04:49:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 04:49:53,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:53,820 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:53,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:49:53,820 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash -921459591, now seen corresponding path program 1 times [2021-11-03 04:49:53,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:53,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111501105] [2021-11-03 04:49:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:53,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:53,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:53,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111501105] [2021-11-03 04:49:53,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111501105] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:53,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85930875] [2021-11-03 04:49:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:53,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:53,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:53,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 04:49:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:53,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-03 04:49:53,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:54,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:54,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85930875] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:49:54,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188141678] [2021-11-03 04:49:54,399 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-03 04:49:54,399 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:49:54,404 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:49:54,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:49:54,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-03 04:49:54,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119625372] [2021-11-03 04:49:54,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 04:49:54,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 04:49:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-03 04:49:54,408 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:54,686 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2021-11-03 04:49:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:49:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-03 04:49:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:54,689 INFO L225 Difference]: With dead ends: 247 [2021-11-03 04:49:54,689 INFO L226 Difference]: Without dead ends: 140 [2021-11-03 04:49:54,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-11-03 04:49:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-03 04:49:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2021-11-03 04:49:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 112 states have internal predecessors, (138), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-03 04:49:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2021-11-03 04:49:54,704 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 23 [2021-11-03 04:49:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:54,705 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2021-11-03 04:49:54,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2021-11-03 04:49:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 04:49:54,707 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:54,707 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:54,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-03 04:49:54,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:54,926 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 200055403, now seen corresponding path program 1 times [2021-11-03 04:49:54,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:54,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481083917] [2021-11-03 04:49:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:54,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:54,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:54,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481083917] [2021-11-03 04:49:54,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481083917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:49:54,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:49:54,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:49:54,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20359486] [2021-11-03 04:49:54,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:49:54,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:49:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:49:54,965 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:55,042 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2021-11-03 04:49:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:49:55,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-11-03 04:49:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:55,046 INFO L225 Difference]: With dead ends: 163 [2021-11-03 04:49:55,046 INFO L226 Difference]: Without dead ends: 161 [2021-11-03 04:49:55,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:49:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-03 04:49:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2021-11-03 04:49:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 124 states have internal predecessors, (154), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-03 04:49:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2021-11-03 04:49:55,066 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 25 [2021-11-03 04:49:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:55,066 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2021-11-03 04:49:55,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2021-11-03 04:49:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 04:49:55,070 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:55,070 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:55,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:49:55,071 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash -759184931, now seen corresponding path program 1 times [2021-11-03 04:49:55,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:55,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329989483] [2021-11-03 04:49:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:55,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:49:55,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:55,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329989483] [2021-11-03 04:49:55,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329989483] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:55,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65178848] [2021-11-03 04:49:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:55,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:55,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:55,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:55,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 04:49:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:55,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-03 04:49:55,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:55,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:55,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65178848] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:55,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:49:55,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 9] total 23 [2021-11-03 04:49:55,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299330854] [2021-11-03 04:49:55,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 04:49:55,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 04:49:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-11-03 04:49:55,893 INFO L87 Difference]: Start difference. First operand 152 states and 189 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:56,120 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2021-11-03 04:49:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 04:49:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-03 04:49:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:56,123 INFO L225 Difference]: With dead ends: 174 [2021-11-03 04:49:56,123 INFO L226 Difference]: Without dead ends: 173 [2021-11-03 04:49:56,124 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-11-03 04:49:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-03 04:49:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2021-11-03 04:49:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.302325581395349) internal successors, (168), 136 states have internal predecessors, (168), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-03 04:49:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2021-11-03 04:49:56,135 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 25 [2021-11-03 04:49:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:56,136 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2021-11-03 04:49:56,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2021-11-03 04:49:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 04:49:56,137 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:56,137 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:49:56,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:49:56,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-03 04:49:56,362 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2059896319, now seen corresponding path program 1 times [2021-11-03 04:49:56,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:56,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084378391] [2021-11-03 04:49:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:56,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:49:56,421 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:56,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084378391] [2021-11-03 04:49:56,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084378391] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:56,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20860368] [2021-11-03 04:49:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:56,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:56,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:56,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 04:49:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:56,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-03 04:49:56,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:56,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:57,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20860368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:49:57,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [687644894] [2021-11-03 04:49:57,015 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-11-03 04:49:57,016 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:49:57,016 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:49:57,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:49:57,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2021-11-03 04:49:57,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339792676] [2021-11-03 04:49:57,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 04:49:57,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 04:49:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-11-03 04:49:57,019 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:57,574 INFO L93 Difference]: Finished difference Result 190 states and 238 transitions. [2021-11-03 04:49:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 04:49:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 04:49:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:57,577 INFO L225 Difference]: With dead ends: 190 [2021-11-03 04:49:57,577 INFO L226 Difference]: Without dead ends: 188 [2021-11-03 04:49:57,578 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2021-11-03 04:49:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-03 04:49:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2021-11-03 04:49:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 146 states have internal predecessors, (179), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2021-11-03 04:49:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2021-11-03 04:49:57,590 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 26 [2021-11-03 04:49:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:57,591 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2021-11-03 04:49:57,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 13 states have internal predecessors, (62), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:49:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2021-11-03 04:49:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 04:49:57,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:57,592 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-03 04:49:57,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 04:49:57,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-03 04:49:57,818 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 214951410, now seen corresponding path program 1 times [2021-11-03 04:49:57,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:57,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583909153] [2021-11-03 04:49:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:57,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:57,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:57,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583909153] [2021-11-03 04:49:57,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583909153] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:57,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114806912] [2021-11-03 04:49:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:57,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:57,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:57,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 04:49:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:58,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 04:49:58,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:49:58,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:49:58,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114806912] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:49:58,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705245335] [2021-11-03 04:49:58,159 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:49:58,159 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:49:58,159 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:49:58,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:49:58,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-11-03 04:49:58,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143975596] [2021-11-03 04:49:58,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 04:49:58,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:58,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 04:49:58,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-03 04:49:58,162 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:58,224 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2021-11-03 04:49:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:49:58,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-03 04:49:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:58,226 INFO L225 Difference]: With dead ends: 194 [2021-11-03 04:49:58,227 INFO L226 Difference]: Without dead ends: 146 [2021-11-03 04:49:58,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-03 04:49:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-03 04:49:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2021-11-03 04:49:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 115 states have internal predecessors, (136), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-03 04:49:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2021-11-03 04:49:58,238 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 30 [2021-11-03 04:49:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:58,238 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2021-11-03 04:49:58,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:49:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2021-11-03 04:49:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-03 04:49:58,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:58,240 INFO L513 BasicCegarLoop]: 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] [2021-11-03 04:49:58,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 04:49:58,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:58,454 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1031540798, now seen corresponding path program 1 times [2021-11-03 04:49:58,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:58,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293694525] [2021-11-03 04:49:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:58,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:58,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:58,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293694525] [2021-11-03 04:49:58,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293694525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:58,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680190506] [2021-11-03 04:49:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:58,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:58,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:58,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 04:49:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:58,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 04:49:58,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:58,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:58,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680190506] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:49:58,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206398967] [2021-11-03 04:49:58,856 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-03 04:49:58,856 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:49:58,856 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:49:58,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:49:58,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-03 04:49:58,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970231931] [2021-11-03 04:49:58,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 04:49:58,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:58,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 04:49:58,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-03 04:49:58,859 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 04:49:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:58,937 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2021-11-03 04:49:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:49:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-11-03 04:49:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:58,939 INFO L225 Difference]: With dead ends: 152 [2021-11-03 04:49:58,940 INFO L226 Difference]: Without dead ends: 151 [2021-11-03 04:49:58,941 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-03 04:49:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-03 04:49:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2021-11-03 04:49:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.205128205128205) internal successors, (141), 119 states have internal predecessors, (141), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2021-11-03 04:49:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2021-11-03 04:49:58,954 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 29 [2021-11-03 04:49:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:58,954 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2021-11-03 04:49:58,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 04:49:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2021-11-03 04:49:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 04:49:58,955 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:58,955 INFO L513 BasicCegarLoop]: 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] [2021-11-03 04:49:58,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 04:49:59,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-03 04:49:59,174 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1912993572, now seen corresponding path program 1 times [2021-11-03 04:49:59,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:59,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935329623] [2021-11-03 04:49:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:59,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:49:59,216 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:49:59,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935329623] [2021-11-03 04:49:59,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935329623] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:49:59,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360535211] [2021-11-03 04:49:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:59,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:49:59,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:49:59,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:49:59,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 04:49:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:49:59,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-03 04:49:59,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:49:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:59,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:49:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:49:59,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360535211] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:49:59,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1190440052] [2021-11-03 04:49:59,578 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:49:59,578 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:49:59,578 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:49:59,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:49:59,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2021-11-03 04:49:59,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921111542] [2021-11-03 04:49:59,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 04:49:59,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:49:59,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 04:49:59,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-03 04:49:59,581 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-03 04:49:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:49:59,725 INFO L93 Difference]: Finished difference Result 159 states and 191 transitions. [2021-11-03 04:49:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 04:49:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2021-11-03 04:49:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:49:59,727 INFO L225 Difference]: With dead ends: 159 [2021-11-03 04:49:59,727 INFO L226 Difference]: Without dead ends: 142 [2021-11-03 04:49:59,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-11-03 04:49:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-03 04:49:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2021-11-03 04:49:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 113 states have internal predecessors, (132), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-03 04:49:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2021-11-03 04:49:59,738 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 30 [2021-11-03 04:49:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:49:59,739 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2021-11-03 04:49:59,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-03 04:49:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2021-11-03 04:49:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 04:49:59,740 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:49:59,741 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-03 04:49:59,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 04:49:59,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-03 04:49:59,962 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:49:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:49:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1897863652, now seen corresponding path program 1 times [2021-11-03 04:49:59,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:49:59,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540419903] [2021-11-03 04:49:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:49:59,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:49:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:50:00,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:00,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540419903] [2021-11-03 04:50:00,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540419903] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:00,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563334029] [2021-11-03 04:50:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:00,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:00,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:00,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:00,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 04:50:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:00,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 04:50:00,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:50:00,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:50:00,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563334029] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:50:00,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [960530751] [2021-11-03 04:50:00,402 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-03 04:50:00,402 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:00,402 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:00,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:50:00,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-03 04:50:00,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188347055] [2021-11-03 04:50:00,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 04:50:00,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 04:50:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-03 04:50:00,405 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 04:50:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:00,469 INFO L93 Difference]: Finished difference Result 148 states and 174 transitions. [2021-11-03 04:50:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:50:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-11-03 04:50:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:00,471 INFO L225 Difference]: With dead ends: 148 [2021-11-03 04:50:00,471 INFO L226 Difference]: Without dead ends: 145 [2021-11-03 04:50:00,471 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-03 04:50:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-03 04:50:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-11-03 04:50:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 116 states have internal predecessors, (135), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-03 04:50:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2021-11-03 04:50:00,485 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 30 [2021-11-03 04:50:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:00,486 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2021-11-03 04:50:00,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 04:50:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2021-11-03 04:50:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-03 04:50:00,487 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:00,488 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:00,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:00,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:00,710 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:00,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash 945477369, now seen corresponding path program 2 times [2021-11-03 04:50:00,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:00,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518323989] [2021-11-03 04:50:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:00,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:50:00,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:00,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518323989] [2021-11-03 04:50:00,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518323989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:00,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606973384] [2021-11-03 04:50:00,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:50:00,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:00,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:00,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-03 04:50:00,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 04:50:00,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:50:00,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-03 04:50:00,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:50:01,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:50:01,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606973384] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:50:01,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [565763121] [2021-11-03 04:50:01,262 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-03 04:50:01,262 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:01,262 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:01,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:50:01,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-11-03 04:50:01,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125680244] [2021-11-03 04:50:01,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 04:50:01,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 04:50:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-03 04:50:01,265 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 13 states have internal predecessors, (54), 9 states have call successors, (9), 6 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:01,531 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2021-11-03 04:50:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:50:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 13 states have internal predecessors, (54), 9 states have call successors, (9), 6 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-03 04:50:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:01,532 INFO L225 Difference]: With dead ends: 152 [2021-11-03 04:50:01,532 INFO L226 Difference]: Without dead ends: 151 [2021-11-03 04:50:01,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-11-03 04:50:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-03 04:50:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2021-11-03 04:50:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 116 states have internal predecessors, (133), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-03 04:50:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2021-11-03 04:50:01,542 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 31 [2021-11-03 04:50:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:01,542 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2021-11-03 04:50:01,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 13 states have internal predecessors, (54), 9 states have call successors, (9), 6 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2021-11-03 04:50:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-03 04:50:01,543 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:01,543 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:01,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:01,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:01,766 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1342949058, now seen corresponding path program 1 times [2021-11-03 04:50:01,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:01,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531973344] [2021-11-03 04:50:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:01,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:50:01,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:01,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531973344] [2021-11-03 04:50:01,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531973344] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:01,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923812972] [2021-11-03 04:50:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:01,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:01,800 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:01,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-03 04:50:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:02,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 04:50:02,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:50:02,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:50:02,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923812972] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:50:02,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [320134861] [2021-11-03 04:50:02,196 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-11-03 04:50:02,197 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:02,197 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:02,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:50:02,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-03 04:50:02,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911848033] [2021-11-03 04:50:02,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:50:02,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:50:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:50:02,201 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:02,275 INFO L93 Difference]: Finished difference Result 273 states and 328 transitions. [2021-11-03 04:50:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:50:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-03 04:50:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:02,277 INFO L225 Difference]: With dead ends: 273 [2021-11-03 04:50:02,277 INFO L226 Difference]: Without dead ends: 148 [2021-11-03 04:50:02,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 04:50:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-03 04:50:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2021-11-03 04:50:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 112 states have internal predecessors, (127), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2021-11-03 04:50:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2021-11-03 04:50:02,290 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 37 [2021-11-03 04:50:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:02,291 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2021-11-03 04:50:02,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2021-11-03 04:50:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-03 04:50:02,292 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:02,292 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:02,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:02,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-03 04:50:02,518 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2084074982, now seen corresponding path program 1 times [2021-11-03 04:50:02,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:02,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103495287] [2021-11-03 04:50:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:02,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:50:02,566 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:02,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103495287] [2021-11-03 04:50:02,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103495287] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:02,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771071692] [2021-11-03 04:50:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:02,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:02,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:02,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-03 04:50:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:02,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-03 04:50:02,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:50:03,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:50:03,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771071692] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:03,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-03 04:50:03,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 18 [2021-11-03 04:50:03,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921596675] [2021-11-03 04:50:03,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:50:03,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:50:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-03 04:50:03,181 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:03,340 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2021-11-03 04:50:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:50:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-03 04:50:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:03,347 INFO L225 Difference]: With dead ends: 145 [2021-11-03 04:50:03,347 INFO L226 Difference]: Without dead ends: 144 [2021-11-03 04:50:03,348 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2021-11-03 04:50:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-03 04:50:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2021-11-03 04:50:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.1261261261261262) internal successors, (125), 111 states have internal predecessors, (125), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2021-11-03 04:50:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2021-11-03 04:50:03,369 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 39 [2021-11-03 04:50:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:03,369 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2021-11-03 04:50:03,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:50:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2021-11-03 04:50:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:50:03,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:03,371 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-03 04:50:03,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:03,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:03,594 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -794105240, now seen corresponding path program 1 times [2021-11-03 04:50:03,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:03,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720889985] [2021-11-03 04:50:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:03,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:50:03,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:03,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720889985] [2021-11-03 04:50:03,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720889985] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:03,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925847392] [2021-11-03 04:50:03,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:03,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:03,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:03,714 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:03,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-03 04:50:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:03,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 04:50:04,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:50:04,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:50:04,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925847392] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:50:04,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285926288] [2021-11-03 04:50:04,442 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:50:04,442 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:04,443 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:04,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:50:04,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-11-03 04:50:04,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427216491] [2021-11-03 04:50:04,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 04:50:04,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 04:50:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-03 04:50:04,445 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-03 04:50:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:04,635 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2021-11-03 04:50:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:50:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 42 [2021-11-03 04:50:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:04,637 INFO L225 Difference]: With dead ends: 153 [2021-11-03 04:50:04,637 INFO L226 Difference]: Without dead ends: 148 [2021-11-03 04:50:04,638 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2021-11-03 04:50:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-03 04:50:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-03 04:50:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 119 states have (on average 1.1176470588235294) internal successors, (133), 119 states have internal predecessors, (133), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (18), 18 states have call predecessors, (18), 15 states have call successors, (18) [2021-11-03 04:50:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2021-11-03 04:50:04,654 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 42 [2021-11-03 04:50:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:04,655 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2021-11-03 04:50:04,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-03 04:50:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2021-11-03 04:50:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-03 04:50:04,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:04,656 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:04,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:04,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:04,870 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash -689863960, now seen corresponding path program 2 times [2021-11-03 04:50:04,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:04,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954922831] [2021-11-03 04:50:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:04,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-03 04:50:05,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:05,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954922831] [2021-11-03 04:50:05,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954922831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:05,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896899470] [2021-11-03 04:50:05,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:50:05,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:05,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:05,034 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:05,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-03 04:50:05,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-03 04:50:05,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:50:05,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-03 04:50:05,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-03 04:50:05,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:50:06,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896899470] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:50:06,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789691410] [2021-11-03 04:50:06,629 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:50:06,629 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:06,629 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:06,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:50:06,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 32 [2021-11-03 04:50:06,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724099814] [2021-11-03 04:50:06,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-03 04:50:06,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-03 04:50:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 04:50:06,632 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2021-11-03 04:50:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:07,132 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2021-11-03 04:50:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 04:50:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Word has length 66 [2021-11-03 04:50:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:07,134 INFO L225 Difference]: With dead ends: 177 [2021-11-03 04:50:07,134 INFO L226 Difference]: Without dead ends: 168 [2021-11-03 04:50:07,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2021-11-03 04:50:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-03 04:50:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-03 04:50:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.1037037037037036) internal successors, (149), 135 states have internal predecessors, (149), 16 states have call successors, (16), 10 states have call predecessors, (16), 16 states have return successors, (22), 22 states have call predecessors, (22), 15 states have call successors, (22) [2021-11-03 04:50:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 187 transitions. [2021-11-03 04:50:07,147 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 187 transitions. Word has length 66 [2021-11-03 04:50:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:07,147 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 187 transitions. [2021-11-03 04:50:07,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2021-11-03 04:50:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 187 transitions. [2021-11-03 04:50:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-03 04:50:07,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:07,150 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:07,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:07,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-03 04:50:07,370 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 293243368, now seen corresponding path program 3 times [2021-11-03 04:50:07,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:07,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554101372] [2021-11-03 04:50:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:07,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-11-03 04:50:07,753 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:07,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554101372] [2021-11-03 04:50:07,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554101372] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:07,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75957503] [2021-11-03 04:50:07,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:50:07,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:07,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:07,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-03 04:50:08,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:50:08,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:50:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-03 04:50:08,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-11-03 04:50:08,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:15,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_29] [2021-11-03 04:50:15,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745010773] [2021-11-03 04:50:15,265 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:50:15,265 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:15,266 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:15,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:50:15,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-03 04:50:15,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357130068] [2021-11-03 04:50:15,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-03 04:50:15,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-03 04:50:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1180, Unknown=1, NotChecked=0, Total=1332 [2021-11-03 04:50:15,269 INFO L87 Difference]: Start difference. First operand 168 states and 187 transitions. Second operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-03 04:50:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:16,077 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2021-11-03 04:50:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-03 04:50:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) Word has length 128 [2021-11-03 04:50:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:16,080 INFO L225 Difference]: With dead ends: 177 [2021-11-03 04:50:16,080 INFO L226 Difference]: Without dead ends: 174 [2021-11-03 04:50:16,081 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 121 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=365, Invalid=2496, Unknown=1, NotChecked=0, Total=2862 [2021-11-03 04:50:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-03 04:50:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2021-11-03 04:50:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 139 states have internal predecessors, (153), 16 states have call successors, (16), 10 states have call predecessors, (16), 17 states have return successors, (23), 23 states have call predecessors, (23), 15 states have call successors, (23) [2021-11-03 04:50:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2021-11-03 04:50:16,091 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 128 [2021-11-03 04:50:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:16,092 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2021-11-03 04:50:16,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-03 04:50:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2021-11-03 04:50:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-03 04:50:16,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:16,094 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:16,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:16,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-03 04:50:16,314 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash -855718884, now seen corresponding path program 4 times [2021-11-03 04:50:16,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:16,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534209829] [2021-11-03 04:50:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:16,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-03 04:50:16,809 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:16,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534209829] [2021-11-03 04:50:16,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534209829] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:16,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236364573] [2021-11-03 04:50:16,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:50:16,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:16,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:16,814 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:16,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-03 04:50:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:17,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-03 04:50:17,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-03 04:50:18,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:50:24,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_42 Int) (|aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| Int) (v_mult_~n_BEFORE_CALL_41 Int)) (or (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_41) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_41 (- 5)) 1431655760) (- 2))))) (<= |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| 238609295) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_42 v_mult_~n_BEFORE_CALL_41) (+ (* 2 |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104|) 1431655761)) (and (exists ((|v_mult_#in~n_393| Int)) (and (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_42 (- 5)) 1431655760) (- 2))) (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_42))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_26_59| Int)) (or (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) v_mult_~n_BEFORE_CALL_41) 715827883)))) (< v_mult_~n_BEFORE_CALL_42 |c_mult_#in~n|))) is different from false [2021-11-03 04:50:27,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_42 Int) (|aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| Int) (v_mult_~n_BEFORE_CALL_41 Int)) (or (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_41) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_41 (- 5)) 1431655760) (- 2))))) (<= (+ |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_42 v_mult_~n_BEFORE_CALL_41 c_mult_~n) (+ (* 2 |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104|) 1431655761)) (<= |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| 238609295) (and (exists ((|v_mult_#in~n_393| Int)) (and (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_42 (- 5)) 1431655760) (- 2))) (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_42))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_26_59| Int)) (or (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) v_mult_~n_BEFORE_CALL_41) 715827883)))) (< v_mult_~n_BEFORE_CALL_42 |c_mult_#in~n|))) is different from false [2021-11-03 04:50:36,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_43 Int) (v_mult_~n_BEFORE_CALL_42 Int) (|aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| Int) (v_mult_~n_BEFORE_CALL_41 Int)) (or (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_41) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_41 (- 5)) 1431655760) (- 2))))) (<= |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| 238609295) (< v_mult_~n_BEFORE_CALL_43 |c_mult_#in~n|) (and (exists ((|v_mult_#in~n_393| Int)) (and (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_42 (- 5)) 1431655760) (- 2))) (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_42))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_26_59| Int)) (or (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) v_mult_~n_BEFORE_CALL_41) 715827883)))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_43 v_mult_~n_BEFORE_CALL_42 v_mult_~n_BEFORE_CALL_41) (+ (* 2 |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104|) 1431655761)) (and (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_43) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_43 (- 5)) 1431655760) (- 2))))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_27_59| Int)) (or (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_27_59|) v_mult_~n_BEFORE_CALL_42) 715827883) (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_27_59|)))))) is different from false [2021-11-03 04:50:39,969 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_43 Int) (v_mult_~n_BEFORE_CALL_42 Int) (|aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| Int) (v_mult_~n_BEFORE_CALL_41 Int)) (or (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_41) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_41 (- 5)) 1431655760) (- 2))))) (<= |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104| 238609295) (<= (+ |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_43 v_mult_~n_BEFORE_CALL_42 v_mult_~n_BEFORE_CALL_41 c_mult_~n) (+ (* 2 |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104|) 1431655761)) (< v_mult_~n_BEFORE_CALL_43 |c_mult_#in~n|) (and (exists ((|v_mult_#in~n_393| Int)) (and (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_42 (- 5)) 1431655760) (- 2))) (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_42))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_26_59| Int)) (or (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_26_59|) v_mult_~n_BEFORE_CALL_41) 715827883)))) (and (exists ((|v_mult_#in~n_393| Int)) (and (<= |v_mult_#in~n_393| v_mult_~n_BEFORE_CALL_43) (< 238609296 (div (+ (* |v_mult_#in~n_393| (- 3)) (* v_mult_~n_BEFORE_CALL_43 (- 5)) 1431655760) (- 2))))) (forall ((|aux_div_v_mult_#in~n_BEFORE_CALL_27_59| Int)) (or (< (+ (* 2 |aux_div_v_mult_#in~n_BEFORE_CALL_27_59|) v_mult_~n_BEFORE_CALL_42) 715827883) (< 238609294 |aux_div_v_mult_#in~n_BEFORE_CALL_27_59|)))))) is different from false [2021-11-03 04:50:53,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_43, v_mult_~n_BEFORE_CALL_42, |aux_div_v_mult_#t~ret8_AFTER_RETURN_13_104|] [2021-11-03 04:50:53,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884914702] [2021-11-03 04:50:53,795 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:50:53,795 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:50:53,796 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:50:53,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:50:53,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-03 04:50:53,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977501580] [2021-11-03 04:50:53,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-03 04:50:53,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:50:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-03 04:50:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1585, Unknown=8, NotChecked=340, Total=2162 [2021-11-03 04:50:53,800 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-03 04:50:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:50:55,053 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2021-11-03 04:50:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 04:50:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) Word has length 126 [2021-11-03 04:50:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:50:55,056 INFO L225 Difference]: With dead ends: 182 [2021-11-03 04:50:55,056 INFO L226 Difference]: Without dead ends: 179 [2021-11-03 04:50:55,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 127 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=506, Invalid=3284, Unknown=8, NotChecked=492, Total=4290 [2021-11-03 04:50:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-03 04:50:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2021-11-03 04:50:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 143 states have (on average 1.097902097902098) internal successors, (157), 143 states have internal predecessors, (157), 16 states have call successors, (16), 10 states have call predecessors, (16), 18 states have return successors, (24), 24 states have call predecessors, (24), 15 states have call successors, (24) [2021-11-03 04:50:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2021-11-03 04:50:55,069 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 126 [2021-11-03 04:50:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:50:55,070 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2021-11-03 04:50:55,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-03 04:50:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2021-11-03 04:50:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-03 04:50:55,073 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:50:55,073 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:50:55,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-03 04:50:55,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:55,290 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:50:55,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:50:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash -369259416, now seen corresponding path program 5 times [2021-11-03 04:50:55,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:50:55,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9528525] [2021-11-03 04:50:55,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:50:55,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:50:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:50:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-03 04:50:56,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:50:56,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9528525] [2021-11-03 04:50:56,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9528525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:50:56,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949588200] [2021-11-03 04:50:56,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:50:56,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:50:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:50:56,030 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:50:56,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-03 04:50:56,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-03 04:50:56,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:50:56,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-03 04:50:56,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:50:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-03 04:50:57,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:51:05,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_56 Int) (v_mult_~n_BEFORE_CALL_55 Int) (|v_mult_#in~n_BEFORE_CALL_38| Int)) (or (< v_mult_~n_BEFORE_CALL_55 |v_mult_#in~n_BEFORE_CALL_38|) (< v_mult_~n_BEFORE_CALL_56 |c_mult_#in~n|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_56 v_mult_~n_BEFORE_CALL_55) 2147483647) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_55_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_55_57 Int)) (and (forall ((|v_mult_#in~n_675| Int)) (or (< 2147483646 (+ (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57 |v_mult_#in~n_675|)) (<= 4294967292 (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_55_57) (* 6 aux_div_v_mult_~n_BEFORE_CALL_55_57) (div (+ (* |v_mult_#in~n_675| (- 2)) (* aux_div_v_mult_~n_BEFORE_CALL_55_57 6) (* aux_mod_v_mult_~n_BEFORE_CALL_55_57 2) (- 2147483646)) 3))))) (< aux_div_v_mult_~n_BEFORE_CALL_55_57 (* 3 v_mult_~n_BEFORE_CALL_56)) (< aux_mod_v_mult_~n_BEFORE_CALL_55_57 3) (<= (+ |v_mult_#in~n_BEFORE_CALL_38| (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_55_57))) (exists ((|v_mult_#in~n_675| Int)) (and (< (div (+ (* v_mult_~n_BEFORE_CALL_55 (- 2)) (* |v_mult_#in~n_675| (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_55)) (<= |v_mult_#in~n_675| v_mult_~n_BEFORE_CALL_55))))) is different from false [2021-11-03 04:51:08,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_56 Int) (v_mult_~n_BEFORE_CALL_55 Int) (|v_mult_#in~n_BEFORE_CALL_38| Int)) (or (< v_mult_~n_BEFORE_CALL_55 |v_mult_#in~n_BEFORE_CALL_38|) (<= (+ |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_56 v_mult_~n_BEFORE_CALL_55 c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_56 |c_mult_#in~n|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_55_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_55_57 Int)) (and (forall ((|v_mult_#in~n_675| Int)) (or (< 2147483646 (+ (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57 |v_mult_#in~n_675|)) (<= 4294967292 (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_55_57) (* 6 aux_div_v_mult_~n_BEFORE_CALL_55_57) (div (+ (* |v_mult_#in~n_675| (- 2)) (* aux_div_v_mult_~n_BEFORE_CALL_55_57 6) (* aux_mod_v_mult_~n_BEFORE_CALL_55_57 2) (- 2147483646)) 3))))) (< aux_div_v_mult_~n_BEFORE_CALL_55_57 (* 3 v_mult_~n_BEFORE_CALL_56)) (< aux_mod_v_mult_~n_BEFORE_CALL_55_57 3) (<= (+ |v_mult_#in~n_BEFORE_CALL_38| (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_55_57))) (exists ((|v_mult_#in~n_675| Int)) (and (< (div (+ (* v_mult_~n_BEFORE_CALL_55 (- 2)) (* |v_mult_#in~n_675| (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_55)) (<= |v_mult_#in~n_675| v_mult_~n_BEFORE_CALL_55))))) is different from false [2021-11-03 04:51:13,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_56 Int) (aux_mod_v_mult_~n_BEFORE_CALL_55_110 Int) (|v_mult_#in~n_BEFORE_CALL_38| Int) (aux_div_v_mult_~n_BEFORE_CALL_55_110 Int)) (let ((.cse0 (* 2 c_mult_~n))) (or (< 2147483646 (+ |v_mult_#in~n_BEFORE_CALL_38| aux_mod_v_mult_~n_BEFORE_CALL_55_110 (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_110) .cse0 v_mult_~n_BEFORE_CALL_56)) (< v_mult_~n_BEFORE_CALL_56 |c_mult_#in~n|) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_55_110) (exists ((|v_mult_#in~n_675| Int)) (and (< (+ (* 6 aux_div_v_mult_~n_BEFORE_CALL_55_110) (* 4 c_mult_~n) (* 2 v_mult_~n_BEFORE_CALL_56) (div (+ (* |v_mult_#in~n_675| (- 2)) (* aux_mod_v_mult_~n_BEFORE_CALL_55_110 2) (* c_mult_~n 4) (* v_mult_~n_BEFORE_CALL_56 2) (* aux_div_v_mult_~n_BEFORE_CALL_55_110 6) (- 2147483646)) 3) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_55_110)) 4294967292) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_55_110 (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_110) (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_56 |v_mult_#in~n_675|) 2147483646))) (< aux_mod_v_mult_~n_BEFORE_CALL_55_110 0) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_55_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_55_57 Int)) (and (forall ((|v_mult_#in~n_675| Int)) (or (< 2147483646 (+ (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57 |v_mult_#in~n_675|)) (<= 4294967292 (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_55_57) (* 6 aux_div_v_mult_~n_BEFORE_CALL_55_57) (div (+ (* |v_mult_#in~n_675| (- 2)) (* aux_div_v_mult_~n_BEFORE_CALL_55_57 6) (* aux_mod_v_mult_~n_BEFORE_CALL_55_57 2) (- 2147483646)) 3))))) (< aux_div_v_mult_~n_BEFORE_CALL_55_57 (* 3 v_mult_~n_BEFORE_CALL_56)) (< aux_mod_v_mult_~n_BEFORE_CALL_55_57 3) (<= (+ |v_mult_#in~n_BEFORE_CALL_38| (* 3 aux_div_v_mult_~n_BEFORE_CALL_55_57) aux_mod_v_mult_~n_BEFORE_CALL_55_57) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_55_57))) (<= .cse0 aux_div_v_mult_~n_BEFORE_CALL_55_110)))) is different from false [2021-11-03 04:51:14,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_56, |v_mult_#in~n_BEFORE_CALL_38|] [2021-11-03 04:51:14,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912014086] [2021-11-03 04:51:14,095 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:51:14,095 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:51:14,095 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:51:14,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:51:14,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-03 04:51:14,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589597300] [2021-11-03 04:51:14,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-03 04:51:14,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:51:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-03 04:51:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1628, Unknown=3, NotChecked=252, Total=2070 [2021-11-03 04:51:14,099 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-03 04:51:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:51:15,635 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2021-11-03 04:51:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-03 04:51:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2021-11-03 04:51:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:51:15,638 INFO L225 Difference]: With dead ends: 187 [2021-11-03 04:51:15,638 INFO L226 Difference]: Without dead ends: 184 [2021-11-03 04:51:15,640 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 132 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=453, Invalid=3588, Unknown=3, NotChecked=378, Total=4422 [2021-11-03 04:51:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-03 04:51:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2021-11-03 04:51:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 147 states have internal predecessors, (161), 16 states have call successors, (16), 10 states have call predecessors, (16), 19 states have return successors, (25), 25 states have call predecessors, (25), 15 states have call successors, (25) [2021-11-03 04:51:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 202 transitions. [2021-11-03 04:51:15,650 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 202 transitions. Word has length 138 [2021-11-03 04:51:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:51:15,650 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 202 transitions. [2021-11-03 04:51:15,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-03 04:51:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 202 transitions. [2021-11-03 04:51:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-03 04:51:15,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:51:15,653 INFO L513 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:51:15,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-03 04:51:15,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-03 04:51:15,882 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:51:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:51:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1172360092, now seen corresponding path program 6 times [2021-11-03 04:51:15,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:51:15,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645712976] [2021-11-03 04:51:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:51:15,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:51:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:51:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-11-03 04:51:16,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:51:16,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645712976] [2021-11-03 04:51:16,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645712976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:51:16,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114559255] [2021-11-03 04:51:16,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:51:16,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:51:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:51:16,559 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:51:16,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-03 04:51:17,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:51:17,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:51:17,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-03 04:51:17,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:51:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-11-03 04:51:18,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:51:29,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_50| Int) (v_mult_~n_BEFORE_CALL_69 Int) (v_mult_~n_BEFORE_CALL_70 Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_69_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_69_57 Int)) (and (forall ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (or (< 2147483646 (+ (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57 |v_mult_#in~n_1042|)) (< |v_mult_#in~n_1042| |v_mult_#in~n_1040|) (<= (* 2 |v_mult_#in~n_1040|) (div (+ (* aux_div_v_mult_~n_BEFORE_CALL_69_57 2) (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 3)))) (< aux_mod_v_mult_~n_BEFORE_CALL_69_57 2) (<= (+ |v_mult_#in~n_BEFORE_CALL_50| (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 2147483646) (< aux_div_v_mult_~n_BEFORE_CALL_69_57 (* 5 v_mult_~n_BEFORE_CALL_70)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_69_57))) (< v_mult_~n_BEFORE_CALL_69 |v_mult_#in~n_BEFORE_CALL_50|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_69 v_mult_~n_BEFORE_CALL_70) 2147483647) (exists ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (and (<= |v_mult_#in~n_1040| |v_mult_#in~n_1042|) (< (div (+ (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) (* v_mult_~n_BEFORE_CALL_69 (- 1)) 2147483646) 3) (* 2 |v_mult_#in~n_1040|)) (<= |v_mult_#in~n_1042| v_mult_~n_BEFORE_CALL_69))) (< v_mult_~n_BEFORE_CALL_70 |c_mult_#in~n|))) is different from false [2021-11-03 04:51:33,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_50| Int) (v_mult_~n_BEFORE_CALL_69 Int) (v_mult_~n_BEFORE_CALL_70 Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_69_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_69_57 Int)) (and (forall ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (or (< 2147483646 (+ (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57 |v_mult_#in~n_1042|)) (< |v_mult_#in~n_1042| |v_mult_#in~n_1040|) (<= (* 2 |v_mult_#in~n_1040|) (div (+ (* aux_div_v_mult_~n_BEFORE_CALL_69_57 2) (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 3)))) (< aux_mod_v_mult_~n_BEFORE_CALL_69_57 2) (<= (+ |v_mult_#in~n_BEFORE_CALL_50| (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 2147483646) (< aux_div_v_mult_~n_BEFORE_CALL_69_57 (* 5 v_mult_~n_BEFORE_CALL_70)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_69_57))) (< v_mult_~n_BEFORE_CALL_69 |v_mult_#in~n_BEFORE_CALL_50|) (exists ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (and (<= |v_mult_#in~n_1040| |v_mult_#in~n_1042|) (< (div (+ (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) (* v_mult_~n_BEFORE_CALL_69 (- 1)) 2147483646) 3) (* 2 |v_mult_#in~n_1040|)) (<= |v_mult_#in~n_1042| v_mult_~n_BEFORE_CALL_69))) (< v_mult_~n_BEFORE_CALL_70 |c_mult_#in~n|) (<= (+ |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_69 v_mult_~n_BEFORE_CALL_70 c_mult_~n) 2147483647))) is different from false [2021-11-03 04:51:40,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_1286| Int) (|v_mult_#in~n_BEFORE_CALL_50| Int) (|v_mult_#in~n_1284| Int) (v_mult_~n_BEFORE_CALL_69 Int) (|v_mult_#in~n_1283| Int) (v_mult_~n_BEFORE_CALL_70 Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_69_57 Int) (aux_div_v_mult_~n_BEFORE_CALL_69_57 Int)) (and (forall ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (or (< 2147483646 (+ (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57 |v_mult_#in~n_1042|)) (< |v_mult_#in~n_1042| |v_mult_#in~n_1040|) (<= (* 2 |v_mult_#in~n_1040|) (div (+ (* aux_div_v_mult_~n_BEFORE_CALL_69_57 2) (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 3)))) (< aux_mod_v_mult_~n_BEFORE_CALL_69_57 2) (<= (+ |v_mult_#in~n_BEFORE_CALL_50| (* 2 aux_div_v_mult_~n_BEFORE_CALL_69_57) aux_mod_v_mult_~n_BEFORE_CALL_69_57) 2147483646) (< aux_div_v_mult_~n_BEFORE_CALL_69_57 (* 5 v_mult_~n_BEFORE_CALL_70)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_69_57))) (< v_mult_~n_BEFORE_CALL_69 |v_mult_#in~n_BEFORE_CALL_50|) (< c_mult_~n |v_mult_#in~n_1286|) (exists ((|v_mult_#in~n_1042| Int) (|v_mult_#in~n_1040| Int)) (and (<= |v_mult_#in~n_1040| |v_mult_#in~n_1042|) (< (div (+ (* |v_mult_#in~n_1042| (- 2)) (* |v_mult_#in~n_1040| (- 2)) (* v_mult_~n_BEFORE_CALL_69 (- 1)) 2147483646) 3) (* 2 |v_mult_#in~n_1040|)) (<= |v_mult_#in~n_1042| v_mult_~n_BEFORE_CALL_69))) (< |v_mult_#in~n_1284| |v_mult_#in~n_1283|) (< v_mult_~n_BEFORE_CALL_70 |c_mult_#in~n|) (<= (+ (* 2 |v_mult_#in~n_1284|) (* 3 |v_mult_#in~n_1286|) v_mult_~n_BEFORE_CALL_69 v_mult_~n_BEFORE_CALL_70 c_mult_~n (* 3 |v_mult_#in~n_1283|)) 2147483646) (< |v_mult_#in~n_1286| |v_mult_#in~n_1284|))) is different from false [2021-11-03 04:51:40,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_50|, v_mult_~n_BEFORE_CALL_69, v_mult_~n_BEFORE_CALL_70] [2021-11-03 04:51:40,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434798270] [2021-11-03 04:51:40,722 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:51:40,722 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:51:40,722 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:51:40,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:51:40,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-03 04:51:40,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965108142] [2021-11-03 04:51:40,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-03 04:51:40,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:51:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-03 04:51:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1876, Unknown=4, NotChecked=270, Total=2352 [2021-11-03 04:51:40,726 INFO L87 Difference]: Start difference. First operand 183 states and 202 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-03 04:51:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:51:42,483 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2021-11-03 04:51:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-03 04:51:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 150 [2021-11-03 04:51:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:51:42,485 INFO L225 Difference]: With dead ends: 192 [2021-11-03 04:51:42,485 INFO L226 Difference]: Without dead ends: 189 [2021-11-03 04:51:42,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 143 SyntacticMatches, 12 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=494, Invalid=4206, Unknown=4, NotChecked=408, Total=5112 [2021-11-03 04:51:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-03 04:51:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2021-11-03 04:51:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 151 states have (on average 1.0927152317880795) internal successors, (165), 151 states have internal predecessors, (165), 16 states have call successors, (16), 10 states have call predecessors, (16), 20 states have return successors, (26), 26 states have call predecessors, (26), 15 states have call successors, (26) [2021-11-03 04:51:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2021-11-03 04:51:42,512 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 150 [2021-11-03 04:51:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:51:42,512 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2021-11-03 04:51:42,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-03 04:51:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2021-11-03 04:51:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-03 04:51:42,515 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:51:42,516 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:51:42,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-03 04:51:42,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-03 04:51:42,730 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:51:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:51:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash -137779992, now seen corresponding path program 7 times [2021-11-03 04:51:42,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:51:42,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786556179] [2021-11-03 04:51:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:51:42,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:51:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:51:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 0 proven. 433 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2021-11-03 04:51:43,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:51:43,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786556179] [2021-11-03 04:51:43,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786556179] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:51:43,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741092931] [2021-11-03 04:51:43,470 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:51:43,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:51:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:51:43,470 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:51:43,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-03 04:51:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:51:44,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-03 04:51:44,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:51:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 0 proven. 433 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2021-11-03 04:51:45,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:51:52,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_84] [2021-11-03 04:51:52,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257098020] [2021-11-03 04:51:52,725 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:51:52,725 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:51:52,725 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:51:52,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:51:52,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-03 04:51:52,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267557524] [2021-11-03 04:51:52,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-03 04:51:52,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:51:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-03 04:51:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2141, Unknown=0, NotChecked=0, Total=2352 [2021-11-03 04:51:52,729 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-03 04:51:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:51:54,885 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2021-11-03 04:51:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-03 04:51:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) Word has length 162 [2021-11-03 04:51:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:51:54,888 INFO L225 Difference]: With dead ends: 197 [2021-11-03 04:51:54,888 INFO L226 Difference]: Without dead ends: 194 [2021-11-03 04:51:54,890 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 151 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=529, Invalid=4873, Unknown=0, NotChecked=0, Total=5402 [2021-11-03 04:51:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-03 04:51:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2021-11-03 04:51:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.0903225806451613) internal successors, (169), 155 states have internal predecessors, (169), 16 states have call successors, (16), 10 states have call predecessors, (16), 21 states have return successors, (27), 27 states have call predecessors, (27), 15 states have call successors, (27) [2021-11-03 04:51:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2021-11-03 04:51:54,905 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 162 [2021-11-03 04:51:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:51:54,906 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2021-11-03 04:51:54,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-03 04:51:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2021-11-03 04:51:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-03 04:51:54,915 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:51:54,915 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:51:54,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-03 04:51:55,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-03 04:51:55,142 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:51:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:51:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1631751396, now seen corresponding path program 8 times [2021-11-03 04:51:55,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:51:55,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362229541] [2021-11-03 04:51:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:51:55,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:51:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:51:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2021-11-03 04:51:56,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:51:56,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362229541] [2021-11-03 04:51:56,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362229541] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:51:56,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384029618] [2021-11-03 04:51:56,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:51:56,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:51:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:51:56,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:51:56,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-03 04:51:57,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-11-03 04:51:57,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:51:57,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-03 04:51:57,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:51:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2021-11-03 04:51:59,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:52:14,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_99 Int) (|v_mult_#in~n_BEFORE_CALL_76| Int) (v_mult_~n_BEFORE_CALL_100 Int)) (or (< v_mult_~n_BEFORE_CALL_100 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_99 |v_mult_#in~n_BEFORE_CALL_76|) (exists ((|v_mult_#in~n_2083| Int) (|v_mult_#in~n_2084| Int) (aux_div_v_mult_~n_BEFORE_CALL_99_135 Int) (aux_mod_v_mult_~n_BEFORE_CALL_99_135 Int)) (and (< aux_div_v_mult_~n_BEFORE_CALL_99_135 (+ |v_mult_#in~n_2084| |v_mult_#in~n_2083|)) (< aux_mod_v_mult_~n_BEFORE_CALL_99_135 3) (<= |v_mult_#in~n_2084| |v_mult_#in~n_2083|) (<= (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) |v_mult_#in~n_BEFORE_CALL_76| aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100)) 2147483646) (forall ((|v_mult_#in~n_1887| Int)) (or (< 2147483646 (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100) |v_mult_#in~n_1887|)) (<= 10737418230 (+ (* 5 aux_mod_v_mult_~n_BEFORE_CALL_99_135) (* 15 aux_div_v_mult_~n_BEFORE_CALL_99_135) (* 10 v_mult_~n_BEFORE_CALL_100) (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 10 |v_mult_#in~n_2083|) (* 10 |v_mult_#in~n_2084|))))) (<= |v_mult_#in~n_2083| v_mult_~n_BEFORE_CALL_100) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_99_135))) (<= (+ v_mult_~n_BEFORE_CALL_100 |c_mult_#res| v_mult_~n_BEFORE_CALL_99) 2147483647) (exists ((|v_mult_#in~n_1887| Int)) (and (< (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 5 v_mult_~n_BEFORE_CALL_99)) (<= |v_mult_#in~n_1887| v_mult_~n_BEFORE_CALL_99))))) is different from false [2021-11-03 04:52:19,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_99 Int) (|v_mult_#in~n_BEFORE_CALL_76| Int) (v_mult_~n_BEFORE_CALL_100 Int)) (or (< v_mult_~n_BEFORE_CALL_100 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_99 |v_mult_#in~n_BEFORE_CALL_76|) (exists ((|v_mult_#in~n_2083| Int) (|v_mult_#in~n_2084| Int) (aux_div_v_mult_~n_BEFORE_CALL_99_135 Int) (aux_mod_v_mult_~n_BEFORE_CALL_99_135 Int)) (and (< aux_div_v_mult_~n_BEFORE_CALL_99_135 (+ |v_mult_#in~n_2084| |v_mult_#in~n_2083|)) (< aux_mod_v_mult_~n_BEFORE_CALL_99_135 3) (<= |v_mult_#in~n_2084| |v_mult_#in~n_2083|) (<= (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) |v_mult_#in~n_BEFORE_CALL_76| aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100)) 2147483646) (forall ((|v_mult_#in~n_1887| Int)) (or (< 2147483646 (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100) |v_mult_#in~n_1887|)) (<= 10737418230 (+ (* 5 aux_mod_v_mult_~n_BEFORE_CALL_99_135) (* 15 aux_div_v_mult_~n_BEFORE_CALL_99_135) (* 10 v_mult_~n_BEFORE_CALL_100) (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 10 |v_mult_#in~n_2083|) (* 10 |v_mult_#in~n_2084|))))) (<= |v_mult_#in~n_2083| v_mult_~n_BEFORE_CALL_100) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_99_135))) (<= (+ v_mult_~n_BEFORE_CALL_100 |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_99 c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_1887| Int)) (and (< (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 5 v_mult_~n_BEFORE_CALL_99)) (<= |v_mult_#in~n_1887| v_mult_~n_BEFORE_CALL_99))))) is different from false [2021-11-03 04:52:28,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2254| Int) (v_mult_~n_BEFORE_CALL_99 Int) (|v_mult_#in~n_2252| Int) (|v_mult_#in~n_BEFORE_CALL_76| Int) (|v_mult_#in~n_2258| Int) (v_mult_~n_BEFORE_CALL_100 Int)) (or (< v_mult_~n_BEFORE_CALL_100 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_99 |v_mult_#in~n_BEFORE_CALL_76|) (exists ((|v_mult_#in~n_2083| Int) (|v_mult_#in~n_2084| Int) (aux_div_v_mult_~n_BEFORE_CALL_99_135 Int) (aux_mod_v_mult_~n_BEFORE_CALL_99_135 Int)) (and (< aux_div_v_mult_~n_BEFORE_CALL_99_135 (+ |v_mult_#in~n_2084| |v_mult_#in~n_2083|)) (< aux_mod_v_mult_~n_BEFORE_CALL_99_135 3) (<= |v_mult_#in~n_2084| |v_mult_#in~n_2083|) (<= (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) |v_mult_#in~n_BEFORE_CALL_76| aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100)) 2147483646) (forall ((|v_mult_#in~n_1887| Int)) (or (< 2147483646 (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100) |v_mult_#in~n_1887|)) (<= 10737418230 (+ (* 5 aux_mod_v_mult_~n_BEFORE_CALL_99_135) (* 15 aux_div_v_mult_~n_BEFORE_CALL_99_135) (* 10 v_mult_~n_BEFORE_CALL_100) (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 10 |v_mult_#in~n_2083|) (* 10 |v_mult_#in~n_2084|))))) (<= |v_mult_#in~n_2083| v_mult_~n_BEFORE_CALL_100) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_99_135))) (<= (+ v_mult_~n_BEFORE_CALL_100 (* 5 |v_mult_#in~n_2254|) v_mult_~n_BEFORE_CALL_99 (* 2 |v_mult_#in~n_2252|) c_mult_~n (* 3 |v_mult_#in~n_2258|)) 2147483646) (< |v_mult_#in~n_2258| |v_mult_#in~n_2252|) (< |v_mult_#in~n_2252| |v_mult_#in~n_2254|) (exists ((|v_mult_#in~n_1887| Int)) (and (< (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 5 v_mult_~n_BEFORE_CALL_99)) (<= |v_mult_#in~n_1887| v_mult_~n_BEFORE_CALL_99))) (< c_mult_~n |v_mult_#in~n_2258|))) is different from false [2021-11-03 04:52:30,810 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2254| Int) (v_mult_~n_BEFORE_CALL_99 Int) (|v_mult_#in~n_2252| Int) (|v_mult_#in~n_BEFORE_CALL_76| Int) (|v_mult_#in~n_2258| Int) (v_mult_~n_BEFORE_CALL_100 Int)) (or (< v_mult_~n_BEFORE_CALL_100 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_99 |v_mult_#in~n_BEFORE_CALL_76|) (exists ((|v_mult_#in~n_2083| Int) (|v_mult_#in~n_2084| Int) (aux_div_v_mult_~n_BEFORE_CALL_99_135 Int) (aux_mod_v_mult_~n_BEFORE_CALL_99_135 Int)) (and (< aux_div_v_mult_~n_BEFORE_CALL_99_135 (+ |v_mult_#in~n_2084| |v_mult_#in~n_2083|)) (< aux_mod_v_mult_~n_BEFORE_CALL_99_135 3) (<= |v_mult_#in~n_2084| |v_mult_#in~n_2083|) (<= (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) |v_mult_#in~n_BEFORE_CALL_76| aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100)) 2147483646) (forall ((|v_mult_#in~n_1887| Int)) (or (< 2147483646 (+ (* 2 |v_mult_#in~n_2083|) (* 2 |v_mult_#in~n_2084|) (* 3 aux_div_v_mult_~n_BEFORE_CALL_99_135) aux_mod_v_mult_~n_BEFORE_CALL_99_135 (* 2 v_mult_~n_BEFORE_CALL_100) |v_mult_#in~n_1887|)) (<= 10737418230 (+ (* 5 aux_mod_v_mult_~n_BEFORE_CALL_99_135) (* 15 aux_div_v_mult_~n_BEFORE_CALL_99_135) (* 10 v_mult_~n_BEFORE_CALL_100) (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 10 |v_mult_#in~n_2083|) (* 10 |v_mult_#in~n_2084|))))) (<= |v_mult_#in~n_2083| v_mult_~n_BEFORE_CALL_100) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_99_135))) (<= (+ v_mult_~n_BEFORE_CALL_100 (* 5 |v_mult_#in~n_2254|) v_mult_~n_BEFORE_CALL_99 (* 2 |v_mult_#in~n_2252|) c_mult_~n (* 3 |v_mult_#in~n_2258|)) 2147483646) (< |v_mult_#in~n_2258| |v_mult_#in~n_2252|) (< |v_mult_#in~n_2252| |v_mult_#in~n_2254|) (exists ((|v_mult_#in~n_1887| Int)) (and (< (div (+ 2147483646 (* |v_mult_#in~n_1887| (- 3))) 2) (* 5 v_mult_~n_BEFORE_CALL_99)) (<= |v_mult_#in~n_1887| v_mult_~n_BEFORE_CALL_99))) (< c_mult_~n |v_mult_#in~n_2258|))) is different from true [2021-11-03 04:52:30,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_99, |v_mult_#in~n_BEFORE_CALL_76|, v_mult_~n_BEFORE_CALL_100] [2021-11-03 04:52:30,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790759815] [2021-11-03 04:52:30,826 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:52:30,826 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:52:30,826 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:52:30,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:52:30,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-03 04:52:30,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566317756] [2021-11-03 04:52:30,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-03 04:52:30,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:52:30,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-03 04:52:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2427, Unknown=5, NotChecked=306, Total=2970 [2021-11-03 04:52:30,830 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-03 04:52:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:52:33,409 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2021-11-03 04:52:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-03 04:52:33,410 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) Word has length 174 [2021-11-03 04:52:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:52:33,412 INFO L225 Difference]: With dead ends: 202 [2021-11-03 04:52:33,412 INFO L226 Difference]: Without dead ends: 199 [2021-11-03 04:52:33,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 14 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=576, Invalid=5593, Unknown=5, NotChecked=468, Total=6642 [2021-11-03 04:52:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-03 04:52:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-11-03 04:52:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 159 states have (on average 1.0880503144654088) internal successors, (173), 159 states have internal predecessors, (173), 16 states have call successors, (16), 10 states have call predecessors, (16), 22 states have return successors, (28), 28 states have call predecessors, (28), 15 states have call successors, (28) [2021-11-03 04:52:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 217 transitions. [2021-11-03 04:52:33,427 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 217 transitions. Word has length 174 [2021-11-03 04:52:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:52:33,428 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 217 transitions. [2021-11-03 04:52:33,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-03 04:52:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 217 transitions. [2021-11-03 04:52:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-03 04:52:33,430 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:52:33,430 INFO L513 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:52:33,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-03 04:52:33,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:52:33,650 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:52:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:52:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1947263640, now seen corresponding path program 9 times [2021-11-03 04:52:33,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:52:33,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746241063] [2021-11-03 04:52:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:52:33,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:52:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:52:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2021-11-03 04:52:34,925 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:52:34,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746241063] [2021-11-03 04:52:34,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746241063] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:52:34,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010361236] [2021-11-03 04:52:34,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:52:34,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:52:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:52:34,927 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:52:34,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-03 04:52:36,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:52:36,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:52:36,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-03 04:52:36,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:52:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2021-11-03 04:52:38,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:52:51,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (or (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (< (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88)) (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646)) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 0) (<= (+ (* 2 c_mult_~n) (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|) aux_div_v_mult_~n_BEFORE_CALL_116_88) (< c_mult_~n |v_mult_#in~n_2768|) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |c_mult_#in~n| (* 3 |v_mult_#in~n_2768|))) (< |v_mult_#in~n_2768| |v_mult_#in~n_2770|))) is different from false [2021-11-03 04:52:57,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_116 Int) (v_mult_~n_BEFORE_CALL_117 Int) (|v_mult_#in~n_BEFORE_CALL_91| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_117 v_mult_~n_BEFORE_CALL_116 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_117 |c_mult_#in~n|) (exists ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (and (<= |v_mult_#in~n_2768| v_mult_~n_BEFORE_CALL_117) (<= |v_mult_#in~n_2770| |v_mult_#in~n_2768|) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 2) (forall ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (or (< |v_mult_#in~n_2530| |v_mult_#in~n_2534|) (< |v_mult_#in~n_2534| |v_mult_#in~n_2535|) (<= (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646) (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|))))) (< aux_div_v_mult_~n_BEFORE_CALL_116_88 (+ (* 2 v_mult_~n_BEFORE_CALL_117) (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|)) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 |v_mult_#in~n_BEFORE_CALL_91| (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_116_88))) (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (<= |v_mult_#in~n_2530| v_mult_~n_BEFORE_CALL_116) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (< 2147483646 (+ (* 4 |v_mult_#in~n_2535|) (* 2 v_mult_~n_BEFORE_CALL_116) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|))) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (< v_mult_~n_BEFORE_CALL_116 |v_mult_#in~n_BEFORE_CALL_91|))) is different from false [2021-11-03 04:53:07,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_116 Int) (v_mult_~n_BEFORE_CALL_117 Int) (|v_mult_#in~n_BEFORE_CALL_91| Int)) (or (< v_mult_~n_BEFORE_CALL_117 |c_mult_#in~n|) (exists ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (and (<= |v_mult_#in~n_2768| v_mult_~n_BEFORE_CALL_117) (<= |v_mult_#in~n_2770| |v_mult_#in~n_2768|) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 2) (forall ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (or (< |v_mult_#in~n_2530| |v_mult_#in~n_2534|) (< |v_mult_#in~n_2534| |v_mult_#in~n_2535|) (<= (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646) (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|))))) (< aux_div_v_mult_~n_BEFORE_CALL_116_88 (+ (* 2 v_mult_~n_BEFORE_CALL_117) (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|)) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 |v_mult_#in~n_BEFORE_CALL_91| (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_116_88))) (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (<= |v_mult_#in~n_2530| v_mult_~n_BEFORE_CALL_116) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (< 2147483646 (+ (* 4 |v_mult_#in~n_2535|) (* 2 v_mult_~n_BEFORE_CALL_116) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|))) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (< v_mult_~n_BEFORE_CALL_116 |v_mult_#in~n_BEFORE_CALL_91|) (<= (+ v_mult_~n_BEFORE_CALL_117 v_mult_~n_BEFORE_CALL_116 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-03 04:53:09,393 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_116 Int) (v_mult_~n_BEFORE_CALL_117 Int) (|v_mult_#in~n_BEFORE_CALL_91| Int)) (or (< v_mult_~n_BEFORE_CALL_117 |c_mult_#in~n|) (exists ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (and (<= |v_mult_#in~n_2768| v_mult_~n_BEFORE_CALL_117) (<= |v_mult_#in~n_2770| |v_mult_#in~n_2768|) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 2) (forall ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (or (< |v_mult_#in~n_2530| |v_mult_#in~n_2534|) (< |v_mult_#in~n_2534| |v_mult_#in~n_2535|) (<= (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646) (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|))))) (< aux_div_v_mult_~n_BEFORE_CALL_116_88 (+ (* 2 v_mult_~n_BEFORE_CALL_117) (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|)) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 |v_mult_#in~n_BEFORE_CALL_91| (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_116_88))) (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (<= |v_mult_#in~n_2530| v_mult_~n_BEFORE_CALL_116) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (< 2147483646 (+ (* 4 |v_mult_#in~n_2535|) (* 2 v_mult_~n_BEFORE_CALL_116) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|))) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (< v_mult_~n_BEFORE_CALL_116 |v_mult_#in~n_BEFORE_CALL_91|) (<= (+ v_mult_~n_BEFORE_CALL_117 v_mult_~n_BEFORE_CALL_116 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from true [2021-11-03 04:53:48,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2971| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 Int) (|v_mult_#in~n_2970| Int) (v_mult_~n_BEFORE_CALL_116 Int) (aux_mod_v_mult_~n_BEFORE_CALL_117_142 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 Int) (|v_mult_#in~n_2964| Int) (|v_mult_#in~n_BEFORE_CALL_91| Int)) (or (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_117_142) (< aux_mod_v_mult_~n_BEFORE_CALL_117_142 0) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 0) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_116 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2971|) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) |c_mult_#in~n| (* 2 |v_mult_#in~n_2964|) c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_117_142 (* 3 |v_mult_#in~n_2970|))) (exists ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (and (<= |v_mult_#in~n_2770| |v_mult_#in~n_2768|) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 2) (<= (+ v_mult_~n_BEFORE_CALL_116 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2971|) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2964|) c_mult_~n |v_mult_#in~n_2768| aux_mod_v_mult_~n_BEFORE_CALL_117_142 (* 3 |v_mult_#in~n_2970|)) 2147483646) (forall ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (or (< |v_mult_#in~n_2530| |v_mult_#in~n_2534|) (< |v_mult_#in~n_2534| |v_mult_#in~n_2535|) (<= (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646) (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|))))) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 |v_mult_#in~n_BEFORE_CALL_91| (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (< (+ (* 2 v_mult_~n_BEFORE_CALL_116) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_117_142) (* 2 c_mult_~n) (* 6 |v_mult_#in~n_2970|) (* 4 |v_mult_#in~n_2964|) (* 4 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 4 |v_mult_#in~n_2971|) aux_div_v_mult_~n_BEFORE_CALL_116_88 (* 8 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109)) (+ 4294967292 (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|)))) (< c_mult_~n |v_mult_#in~n_2971|) (< |v_mult_#in~n_2971| |v_mult_#in~n_2970|) (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (<= |v_mult_#in~n_2530| v_mult_~n_BEFORE_CALL_116) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (< 2147483646 (+ (* 4 |v_mult_#in~n_2535|) (* 2 v_mult_~n_BEFORE_CALL_116) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|))) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (<= |v_mult_#in~n_2971| aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (< v_mult_~n_BEFORE_CALL_116 |v_mult_#in~n_BEFORE_CALL_91|) (< |v_mult_#in~n_2970| |v_mult_#in~n_2964|))) is different from false [2021-11-03 04:53:50,486 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2971| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 Int) (|v_mult_#in~n_2970| Int) (v_mult_~n_BEFORE_CALL_116 Int) (aux_mod_v_mult_~n_BEFORE_CALL_117_142 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 Int) (|v_mult_#in~n_2964| Int) (|v_mult_#in~n_BEFORE_CALL_91| Int)) (or (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_117_142) (< aux_mod_v_mult_~n_BEFORE_CALL_117_142 0) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109 0) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_116 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2971|) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) |c_mult_#in~n| (* 2 |v_mult_#in~n_2964|) c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_117_142 (* 3 |v_mult_#in~n_2970|))) (exists ((|v_mult_#in~n_2770| Int) (aux_div_v_mult_~n_BEFORE_CALL_116_88 Int) (aux_mod_v_mult_~n_BEFORE_CALL_116_88 Int) (|v_mult_#in~n_2768| Int)) (and (<= |v_mult_#in~n_2770| |v_mult_#in~n_2768|) (< aux_mod_v_mult_~n_BEFORE_CALL_116_88 2) (<= (+ v_mult_~n_BEFORE_CALL_116 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2971|) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 2 |v_mult_#in~n_2964|) c_mult_~n |v_mult_#in~n_2768| aux_mod_v_mult_~n_BEFORE_CALL_117_142 (* 3 |v_mult_#in~n_2970|)) 2147483646) (forall ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (or (< |v_mult_#in~n_2530| |v_mult_#in~n_2534|) (< |v_mult_#in~n_2534| |v_mult_#in~n_2535|) (<= (+ (* 4 |v_mult_#in~n_2535|) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|) 2147483646) (+ (* 6 |v_mult_#in~n_2768|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_116_88))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) |v_mult_#in~n_2530| (* 3 |v_mult_#in~n_2768|))))) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_116_88 |v_mult_#in~n_BEFORE_CALL_91| (* 2 aux_div_v_mult_~n_BEFORE_CALL_116_88) (* 3 |v_mult_#in~n_2768|)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_116_88) (< (+ (* 2 v_mult_~n_BEFORE_CALL_116) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_117_142) (* 2 c_mult_~n) (* 6 |v_mult_#in~n_2970|) (* 4 |v_mult_#in~n_2964|) (* 4 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (* 4 |v_mult_#in~n_2971|) aux_div_v_mult_~n_BEFORE_CALL_116_88 (* 8 aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109)) (+ 4294967292 (* 2 |v_mult_#in~n_2770|) |v_mult_#in~n_2768|)))) (< c_mult_~n |v_mult_#in~n_2971|) (< |v_mult_#in~n_2971| |v_mult_#in~n_2970|) (exists ((|v_mult_#in~n_2530| Int) (|v_mult_#in~n_2535| Int) (|v_mult_#in~n_2534| Int)) (and (<= |v_mult_#in~n_2530| v_mult_~n_BEFORE_CALL_116) (<= |v_mult_#in~n_2535| |v_mult_#in~n_2534|) (< 2147483646 (+ (* 4 |v_mult_#in~n_2535|) (* 2 v_mult_~n_BEFORE_CALL_116) (* 5 |v_mult_#in~n_2530|) (* 3 |v_mult_#in~n_2534|))) (<= |v_mult_#in~n_2534| |v_mult_#in~n_2530|))) (<= |v_mult_#in~n_2971| aux_div_aux_div_v_mult_~n_BEFORE_CALL_117_142_109) (< v_mult_~n_BEFORE_CALL_116 |v_mult_#in~n_BEFORE_CALL_91|) (< |v_mult_#in~n_2970| |v_mult_#in~n_2964|))) is different from true [2021-11-03 04:53:50,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_116, |v_mult_#in~n_BEFORE_CALL_91|] [2021-11-03 04:53:50,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [540486033] [2021-11-03 04:53:50,506 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:53:50,507 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:53:50,507 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:53:50,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:53:50,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2021-11-03 04:53:50,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60647292] [2021-11-03 04:53:50,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-03 04:53:50,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:50,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-03 04:53:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2656, Unknown=6, NotChecked=428, Total=3306 [2021-11-03 04:53:50,511 INFO L87 Difference]: Start difference. First operand 198 states and 217 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-03 04:53:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:53,110 INFO L93 Difference]: Finished difference Result 207 states and 227 transitions. [2021-11-03 04:53:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-03 04:53:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) Word has length 186 [2021-11-03 04:53:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:53,112 INFO L225 Difference]: With dead ends: 207 [2021-11-03 04:53:53,112 INFO L226 Difference]: Without dead ends: 204 [2021-11-03 04:53:53,115 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 176 SyntacticMatches, 15 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=557, Invalid=6259, Unknown=6, NotChecked=660, Total=7482 [2021-11-03 04:53:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-03 04:53:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2021-11-03 04:53:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 163 states have internal predecessors, (177), 16 states have call successors, (16), 10 states have call predecessors, (16), 23 states have return successors, (29), 29 states have call predecessors, (29), 15 states have call successors, (29) [2021-11-03 04:53:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 222 transitions. [2021-11-03 04:53:53,125 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 222 transitions. Word has length 186 [2021-11-03 04:53:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:53,125 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 222 transitions. [2021-11-03 04:53:53,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-03 04:53:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 222 transitions. [2021-11-03 04:53:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-03 04:53:53,127 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:53,128 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:53,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-03 04:53:53,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:53:53,354 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-03 04:53:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1876783260, now seen corresponding path program 10 times [2021-11-03 04:53:53,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:53,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360149420] [2021-11-03 04:53:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:53,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 859 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-11-03 04:53:54,443 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:54,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360149420] [2021-11-03 04:53:54,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360149420] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:53:54,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556308241] [2021-11-03 04:53:54,444 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:53:54,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:53:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:53:54,445 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:53:54,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcaa0409-bb3f-4de1-a883-8fd90e547637/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-03 04:53:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:55,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-03 04:53:55,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:53:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 859 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-11-03 04:53:58,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:54:14,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int) (aux_mod_v_mult_~n_BEFORE_CALL_136_58 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int)) (or (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 0) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_136_58) (< aux_mod_v_mult_~n_BEFORE_CALL_136_58 0) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (exists ((|v_mult_#in~n_3288| Int) (|v_mult_#in~n_3282| Int) (|v_mult_#in~n_3280| Int)) (and (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) |v_mult_#in~n_3288| (* 10 c_mult_~n)) 2147483646) (<= |v_mult_#in~n_3280| |v_mult_#in~n_3282|) (<= |v_mult_#in~n_3282| |v_mult_#in~n_3288|) (< (div (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* |v_mult_#in~n_3288| (- 3)) (* c_mult_~n 10) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 4) (* |v_mult_#in~n_3282| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 2)) 2) (+ (* 2 |v_mult_#in~n_3288|) (* 2 |v_mult_#in~n_3280|))))) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) |c_mult_#in~n| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 10 c_mult_~n))) (<= c_mult_~n aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66))) is different from false [2021-11-03 04:54:20,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_136 Int) (v_mult_~n_BEFORE_CALL_137 Int) (|v_mult_#in~n_BEFORE_CALL_107| Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int) (aux_mod_v_mult_~n_BEFORE_CALL_136_58 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int)) (and (< aux_mod_v_mult_~n_BEFORE_CALL_136_58 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 v_mult_~n_BEFORE_CALL_137) (forall ((|v_mult_#in~n_3288| Int) (|v_mult_#in~n_3282| Int) (|v_mult_#in~n_3280| Int)) (or (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 10 v_mult_~n_BEFORE_CALL_137) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) |v_mult_#in~n_3288|)) (< |v_mult_#in~n_3288| |v_mult_#in~n_3282|) (<= (+ (* 2 |v_mult_#in~n_3288|) (* 2 |v_mult_#in~n_3280|)) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* |v_mult_#in~n_3288| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 4) (* |v_mult_#in~n_3282| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 2) (* v_mult_~n_BEFORE_CALL_137 10)) 2)) (< |v_mult_#in~n_3282| |v_mult_#in~n_3280|))) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 |v_mult_#in~n_BEFORE_CALL_107| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 10 v_mult_~n_BEFORE_CALL_137) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66)) 2147483646) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_136_58))) (< v_mult_~n_BEFORE_CALL_136 |v_mult_#in~n_BEFORE_CALL_107|) (exists ((|v_mult_#in~n_3288| Int) (|v_mult_#in~n_3282| Int) (|v_mult_#in~n_3280| Int)) (and (<= |v_mult_#in~n_3288| v_mult_~n_BEFORE_CALL_136) (<= |v_mult_#in~n_3280| |v_mult_#in~n_3282|) (<= |v_mult_#in~n_3282| |v_mult_#in~n_3288|) (< (div (+ (* v_mult_~n_BEFORE_CALL_136 (- 1)) (* |v_mult_#in~n_3288| (- 3)) (* |v_mult_#in~n_3282| (- 3)) 2147483646) 2) (+ (* 2 |v_mult_#in~n_3288|) (* 2 |v_mult_#in~n_3280|))))) (<= (+ v_mult_~n_BEFORE_CALL_137 v_mult_~n_BEFORE_CALL_136 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_137 |c_mult_#in~n|))) is different from false [2021-11-03 04:54:30,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_136 Int) (v_mult_~n_BEFORE_CALL_137 Int) (|v_mult_#in~n_BEFORE_CALL_107| Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int) (aux_mod_v_mult_~n_BEFORE_CALL_136_58 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 Int)) (and (< aux_mod_v_mult_~n_BEFORE_CALL_136_58 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 v_mult_~n_BEFORE_CALL_137) (forall ((|v_mult_#in~n_3288| Int) (|v_mult_#in~n_3282| Int) (|v_mult_#in~n_3280| Int)) (or (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 10 v_mult_~n_BEFORE_CALL_137) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) |v_mult_#in~n_3288|)) (< |v_mult_#in~n_3288| |v_mult_#in~n_3282|) (<= (+ (* 2 |v_mult_#in~n_3288|) (* 2 |v_mult_#in~n_3280|)) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 (* |v_mult_#in~n_3288| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 4) (* |v_mult_#in~n_3282| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 2) (* v_mult_~n_BEFORE_CALL_137 10)) 2)) (< |v_mult_#in~n_3282| |v_mult_#in~n_3280|))) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_136_58 |v_mult_#in~n_BEFORE_CALL_107| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (* 10 v_mult_~n_BEFORE_CALL_137) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_136_58_66)) 2147483646) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_136_58_66 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_136_58))) (< v_mult_~n_BEFORE_CALL_136 |v_mult_#in~n_BEFORE_CALL_107|) (<= (+ v_mult_~n_BEFORE_CALL_137 v_mult_~n_BEFORE_CALL_136 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_3288| Int) (|v_mult_#in~n_3282| Int) (|v_mult_#in~n_3280| Int)) (and (<= |v_mult_#in~n_3288| v_mult_~n_BEFORE_CALL_136) (<= |v_mult_#in~n_3280| |v_mult_#in~n_3282|) (<= |v_mult_#in~n_3282| |v_mult_#in~n_3288|) (< (div (+ (* v_mult_~n_BEFORE_CALL_136 (- 1)) (* |v_mult_#in~n_3288| (- 3)) (* |v_mult_#in~n_3282| (- 3)) 2147483646) 2) (+ (* 2 |v_mult_#in~n_3288|) (* 2 |v_mult_#in~n_3280|))))) (< v_mult_~n_BEFORE_CALL_137 |c_mult_#in~n|))) is different from false