./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/MultCommutative-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF --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 ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:21:04,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:21:04,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:21:04,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:21:04,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:21:04,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:21:04,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:21:04,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:21:04,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:21:04,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:21:04,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:21:04,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:21:04,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:21:04,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:21:05,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:21:05,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:21:05,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:21:05,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:21:05,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:21:05,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:21:05,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:21:05,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:21:05,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:21:05,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:21:05,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:21:05,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:21:05,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:21:05,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:21:05,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:21:05,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:21:05,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:21:05,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:21:05,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:21:05,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:21:05,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:21:05,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:21:05,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:21:05,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:21:05,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:21:05,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:21:05,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:21:05,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-12 23:21:05,105 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:21:05,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:21:05,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:21:05,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:21:05,109 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:21:05,109 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:21:05,109 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:21:05,109 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:21:05,117 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:21:05,117 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:21:05,118 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:21:05,118 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:21:05,119 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:21:05,119 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:21:05,119 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:21:05,120 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:21:05,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:21:05,121 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:21:05,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-12 23:21:05,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:21:05,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:21:05,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:21:05,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:21:05,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:21:05,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:21:05,123 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-12 23:21:05,123 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:21:05,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:21:05,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:21:05,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:21:05,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:21:05,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:21:05,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:21:05,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:21:05,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:21:05,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:21:05,126 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:21:05,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:21:05,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:21:05,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:21:05,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:21:05,127 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_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/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_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF 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 -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2021-11-12 23:21:05,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:21:05,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:21:05,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:21:05,507 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:21:05,507 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:21:05,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-12 23:21:05,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/data/3c8b8c499/74b0ce4813014d4c8196a4d6dbbc203a/FLAG8f4e271ba [2021-11-12 23:21:06,032 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:21:06,033 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-12 23:21:06,039 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/data/3c8b8c499/74b0ce4813014d4c8196a4d6dbbc203a/FLAG8f4e271ba [2021-11-12 23:21:06,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/data/3c8b8c499/74b0ce4813014d4c8196a4d6dbbc203a [2021-11-12 23:21:06,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:21:06,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:21:06,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:21:06,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:21:06,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:21:06,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2432eb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06, skipping insertion in model container [2021-11-12 23:21:06,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:21:06,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:21:06,673 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_622af757-118b-43ef-a31f-5fccd63d5708/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-12 23:21:06,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:21:06,682 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:21:06,696 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_622af757-118b-43ef-a31f-5fccd63d5708/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-12 23:21:06,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:21:06,711 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:21:06,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06 WrapperNode [2021-11-12 23:21:06,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:21:06,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:21:06,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:21:06,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:21:06,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:21:06,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:21:06,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:21:06,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:21:06,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:21:06,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:21:06,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:21:06,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:21:06,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (1/1) ... [2021-11-12 23:21:06,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:21:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:06,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:21:06,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:21:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-12 23:21:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-12 23:21:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:21:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:21:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:21:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:21:07,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:21:07,097 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-12 23:21:07,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:21:07 BoogieIcfgContainer [2021-11-12 23:21:07,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:21:07,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:21:07,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:21:07,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:21:07,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:21:06" (1/3) ... [2021-11-12 23:21:07,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a09cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:21:07, skipping insertion in model container [2021-11-12 23:21:07,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:21:06" (2/3) ... [2021-11-12 23:21:07,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a09cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:21:07, skipping insertion in model container [2021-11-12 23:21:07,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:21:07" (3/3) ... [2021-11-12 23:21:07,125 INFO L111 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2021-11-12 23:21:07,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:21:07,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-12 23:21:07,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:21:07,214 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-12 23:21:07,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-12 23:21:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-12 23:21:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-12 23:21:07,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:07,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:07,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1027513993, now seen corresponding path program 1 times [2021-11-12 23:21:07,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:07,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417331641] [2021-11-12 23:21:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:07,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:07,445 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-12 23:21:07,445 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:07,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417331641] [2021-11-12 23:21:07,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417331641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:07,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:07,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:21:07,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696278445] [2021-11-12 23:21:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:07,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:07,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:07,501 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:07,658 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2021-11-12 23:21:07,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:21:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-12 23:21:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:07,670 INFO L225 Difference]: With dead ends: 73 [2021-11-12 23:21:07,671 INFO L226 Difference]: Without dead ends: 42 [2021-11-12 23:21:07,676 INFO L932 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-12 23:21:07,680 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.06ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.85ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:07,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 77 Invalid, 58 Unknown, 0 Unchecked, 11.06ms Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 87.85ms Time] [2021-11-12 23:21:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-12 23:21:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2021-11-12 23:21:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-12 23:21:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-11-12 23:21:07,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2021-11-12 23:21:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:07,747 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-11-12 23:21:07,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-11-12 23:21:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-12 23:21:07,749 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:07,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:07,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:21:07,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1788169763, now seen corresponding path program 1 times [2021-11-12 23:21:07,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:07,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177608084] [2021-11-12 23:21:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:07,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:07,870 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-12 23:21:07,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:07,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177608084] [2021-11-12 23:21:07,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177608084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:07,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:07,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:21:07,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052391040] [2021-11-12 23:21:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:07,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:07,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:07,875 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:07,990 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2021-11-12 23:21:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:21:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-12 23:21:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:08,000 INFO L225 Difference]: With dead ends: 58 [2021-11-12 23:21:08,001 INFO L226 Difference]: Without dead ends: 56 [2021-11-12 23:21:08,005 INFO L932 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-12 23:21:08,007 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.10ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:08,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 58 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 84.10ms Time] [2021-11-12 23:21:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-12 23:21:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2021-11-12 23:21:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 41 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-12 23:21:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2021-11-12 23:21:08,038 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 8 [2021-11-12 23:21:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:08,039 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2021-11-12 23:21:08,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:21:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2021-11-12 23:21:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 23:21:08,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:08,041 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:21:08,041 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1125158968, now seen corresponding path program 1 times [2021-11-12 23:21:08,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834925170] [2021-11-12 23:21:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,143 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-12 23:21:08,143 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834925170] [2021-11-12 23:21:08,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834925170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:08,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:08,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:21:08,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136651930] [2021-11-12 23:21:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:08,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:08,148 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 23:21:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:08,280 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2021-11-12 23:21:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:21:08,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2021-11-12 23:21:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:08,282 INFO L225 Difference]: With dead ends: 76 [2021-11-12 23:21:08,283 INFO L226 Difference]: Without dead ends: 75 [2021-11-12 23:21:08,283 INFO L932 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-12 23:21:08,285 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.18ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.21ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:08,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 55 Unknown, 0 Unchecked, 5.18ms Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 90.21ms Time] [2021-11-12 23:21:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-12 23:21:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2021-11-12 23:21:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 53 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-12 23:21:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2021-11-12 23:21:08,299 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 13 [2021-11-12 23:21:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:08,300 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2021-11-12 23:21:08,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 23:21:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2021-11-12 23:21:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-12 23:21:08,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:08,301 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-12 23:21:08,302 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -691954174, now seen corresponding path program 1 times [2021-11-12 23:21:08,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542824215] [2021-11-12 23:21:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,400 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-12 23:21:08,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542824215] [2021-11-12 23:21:08,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542824215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:08,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:08,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:21:08,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958780257] [2021-11-12 23:21:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:08,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:08,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:08,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:08,405 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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-12 23:21:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:08,499 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2021-11-12 23:21:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:21:08,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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 14 [2021-11-12 23:21:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:08,507 INFO L225 Difference]: With dead ends: 120 [2021-11-12 23:21:08,507 INFO L226 Difference]: Without dead ends: 84 [2021-11-12 23:21:08,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12 23:21:08,517 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.45ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:08,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 49 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 49.45ms Time] [2021-11-12 23:21:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-12 23:21:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2021-11-12 23:21:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 10 states have call successors, (10), 5 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-12 23:21:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2021-11-12 23:21:08,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 14 [2021-11-12 23:21:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:08,540 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2021-11-12 23:21:08,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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-12 23:21:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2021-11-12 23:21:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-12 23:21:08,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:08,542 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 23:21:08,543 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 24264138, now seen corresponding path program 1 times [2021-11-12 23:21:08,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688737796] [2021-11-12 23:21:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:21:08,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688737796] [2021-11-12 23:21:08,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688737796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:08,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:08,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:21:08,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571133362] [2021-11-12 23:21:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:08,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:08,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:08,633 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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-12 23:21:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:08,722 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2021-11-12 23:21:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:21:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2021-11-12 23:21:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:08,725 INFO L225 Difference]: With dead ends: 101 [2021-11-12 23:21:08,725 INFO L226 Difference]: Without dead ends: 100 [2021-11-12 23:21:08,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12 23:21:08,727 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.11ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.03ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:08,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 4.11ms Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 58.03ms Time] [2021-11-12 23:21:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-12 23:21:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2021-11-12 23:21:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 72 states have internal predecessors, (92), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-12 23:21:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-11-12 23:21:08,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 15 [2021-11-12 23:21:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:08,751 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-11-12 23:21:08,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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-12 23:21:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-11-12 23:21:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:21:08,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:08,753 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 23:21:08,754 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1116235770, now seen corresponding path program 1 times [2021-11-12 23:21:08,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725952707] [2021-11-12 23:21:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:08,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725952707] [2021-11-12 23:21:08,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725952707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:21:08,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:21:08,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 23:21:08,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492834506] [2021-11-12 23:21:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:21:08,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:21:08,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:21:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:21:08,827 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-12 23:21:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:08,885 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2021-11-12 23:21:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-12 23:21:08,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2021-11-12 23:21:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:08,887 INFO L225 Difference]: With dead ends: 132 [2021-11-12 23:21:08,887 INFO L226 Difference]: Without dead ends: 58 [2021-11-12 23:21:08,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:21:08,894 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.57ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:08,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 37 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 32.57ms Time] [2021-11-12 23:21:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-12 23:21:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2021-11-12 23:21:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-12 23:21:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-11-12 23:21:08,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 18 [2021-11-12 23:21:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:08,912 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-11-12 23:21:08,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-12 23:21:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-11-12 23:21:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:21:08,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:08,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:08,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 23:21:08,914 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash 937076250, now seen corresponding path program 1 times [2021-11-12 23:21:08,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:08,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132449122] [2021-11-12 23:21:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:08,982 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-12 23:21:08,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:08,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132449122] [2021-11-12 23:21:08,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132449122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:08,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707381321] [2021-11-12 23:21:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:08,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:08,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:08,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:08,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-12 23:21:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:09,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-12 23:21:09,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:09,210 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-12 23:21:09,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:09,316 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-12 23:21:09,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707381321] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:09,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766270394] [2021-11-12 23:21:09,345 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-12 23:21:09,345 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:09,351 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:610) 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-12 23:21:09,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:09,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-12 23:21:09,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034741128] [2021-11-12 23:21:09,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:09,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:21:09,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:21:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:09,358 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:09,495 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-11-12 23:21:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 23:21:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2021-11-12 23:21:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:09,498 INFO L225 Difference]: With dead ends: 66 [2021-11-12 23:21:09,498 INFO L226 Difference]: Without dead ends: 65 [2021-11-12 23:21:09,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:21:09,500 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.51ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.96ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:09,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 101 Invalid, 109 Unknown, 0 Unchecked, 1.51ms Time], IncrementalHoareTripleChecker [16 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 82.96ms Time] [2021-11-12 23:21:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-12 23:21:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-11-12 23:21:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-12 23:21:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2021-11-12 23:21:09,529 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2021-11-12 23:21:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:09,529 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-11-12 23:21:09,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2021-11-12 23:21:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:21:09,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:09,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:09,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:09,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:09,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1015407268, now seen corresponding path program 1 times [2021-11-12 23:21:09,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:09,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297554357] [2021-11-12 23:21:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:09,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:09,852 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-12 23:21:09,853 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:09,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297554357] [2021-11-12 23:21:09,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297554357] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:09,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503810038] [2021-11-12 23:21:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:09,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:09,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:09,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-12 23:21:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:09,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-12 23:21:09,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:09,994 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-12 23:21:09,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:10,077 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-12 23:21:10,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503810038] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:10,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357481102] [2021-11-12 23:21:10,080 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:21:10,080 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:10,081 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:610) 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-12 23:21:10,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:10,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-12 23:21:10,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688693032] [2021-11-12 23:21:10,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:10,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-12 23:21:10,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-12 23:21:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-12 23:21:10,084 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-12 23:21:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:10,198 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2021-11-12 23:21:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 23:21:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-11-12 23:21:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:10,200 INFO L225 Difference]: With dead ends: 64 [2021-11-12 23:21:10,200 INFO L226 Difference]: Without dead ends: 63 [2021-11-12 23:21:10,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:10,205 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.20ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.08ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:10,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 1.20ms Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 74.08ms Time] [2021-11-12 23:21:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-12 23:21:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-11-12 23:21:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-12 23:21:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-11-12 23:21:10,214 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 18 [2021-11-12 23:21:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:10,215 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-11-12 23:21:10,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-12 23:21:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-11-12 23:21:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-12 23:21:10,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:10,216 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:10,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:10,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-12 23:21:10,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2063375789, now seen corresponding path program 1 times [2021-11-12 23:21:10,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:10,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609831931] [2021-11-12 23:21:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:10,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:10,521 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:10,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609831931] [2021-11-12 23:21:10,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609831931] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:10,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760964340] [2021-11-12 23:21:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:10,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:10,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:10,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-12 23:21:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:10,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-12 23:21:10,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:10,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:10,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760964340] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:10,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [676304054] [2021-11-12 23:21:10,857 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-12 23:21:10,857 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:10,858 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:610) 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-12 23:21:10,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:10,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2021-11-12 23:21:10,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217934746] [2021-11-12 23:21:10,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:10,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-12 23:21:10,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-12 23:21:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-12 23:21:10,860 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:11,086 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2021-11-12 23:21:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 23:21:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-11-12 23:21:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:11,089 INFO L225 Difference]: With dead ends: 93 [2021-11-12 23:21:11,090 INFO L226 Difference]: Without dead ends: 92 [2021-11-12 23:21:11,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:21:11,093 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.13ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.84ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:11,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 213 Unknown, 0 Unchecked, 4.13ms Time], IncrementalHoareTripleChecker [12 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 129.84ms Time] [2021-11-12 23:21:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-12 23:21:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2021-11-12 23:21:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-12 23:21:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2021-11-12 23:21:11,114 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 24 [2021-11-12 23:21:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:11,115 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2021-11-12 23:21:11,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2021-11-12 23:21:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:21:11,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:11,117 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:11,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:11,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-12 23:21:11,320 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash 459860035, now seen corresponding path program 1 times [2021-11-12 23:21:11,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:11,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136851380] [2021-11-12 23:21:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:11,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-12 23:21:11,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:11,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136851380] [2021-11-12 23:21:11,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136851380] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:11,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685316611] [2021-11-12 23:21:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:11,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:11,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:11,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-12 23:21:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:11,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-12 23:21:11,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-12 23:21:11,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-12 23:21:11,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685316611] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:11,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401620860] [2021-11-12 23:21:11,570 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:21:11,570 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:11,571 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:610) 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-12 23:21:11,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:11,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-12 23:21:11,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435657128] [2021-11-12 23:21:11,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:11,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-12 23:21:11,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-12 23:21:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-12 23:21:11,573 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:11,665 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2021-11-12 23:21:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 23:21:11,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-11-12 23:21:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:11,667 INFO L225 Difference]: With dead ends: 96 [2021-11-12 23:21:11,667 INFO L226 Difference]: Without dead ends: 63 [2021-11-12 23:21:11,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:21:11,668 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.41ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.41ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:11,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 134 Invalid, 68 Unknown, 0 Unchecked, 1.41ms Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 54.41ms Time] [2021-11-12 23:21:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-12 23:21:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2021-11-12 23:21:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 42 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-12 23:21:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-11-12 23:21:11,674 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 25 [2021-11-12 23:21:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:11,674 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-11-12 23:21:11,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-12 23:21:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-11-12 23:21:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-12 23:21:11,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:11,676 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:11,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:11,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:11,900 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 385020750, now seen corresponding path program 1 times [2021-11-12 23:21:11,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:11,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485702225] [2021-11-12 23:21:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:11,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:12,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:12,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485702225] [2021-11-12 23:21:12,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485702225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:12,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549086533] [2021-11-12 23:21:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:12,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:12,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:12,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-12 23:21:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:12,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-12 23:21:12,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:12,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:21:12,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549086533] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:12,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118347875] [2021-11-12 23:21:12,504 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:21:12,504 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:12,504 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:610) 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-12 23:21:12,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:12,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-12 23:21:12,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819461453] [2021-11-12 23:21:12,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:12,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:21:12,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:21:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:21:12,509 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-12 23:21:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:12,853 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2021-11-12 23:21:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-12 23:21:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2021-11-12 23:21:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:12,855 INFO L225 Difference]: With dead ends: 86 [2021-11-12 23:21:12,856 INFO L226 Difference]: Without dead ends: 85 [2021-11-12 23:21:12,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:21:12,857 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.14ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 139.50ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:12,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 132 Invalid, 218 Unknown, 0 Unchecked, 3.14ms Time], IncrementalHoareTripleChecker [35 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 139.50ms Time] [2021-11-12 23:21:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-12 23:21:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2021-11-12 23:21:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-12 23:21:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-11-12 23:21:12,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 28 [2021-11-12 23:21:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:12,865 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-11-12 23:21:12,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-12 23:21:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2021-11-12 23:21:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-12 23:21:12,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:12,867 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:12,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:13,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:13,092 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -377928031, now seen corresponding path program 1 times [2021-11-12 23:21:13,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:13,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951802528] [2021-11-12 23:21:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:13,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-12 23:21:13,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:13,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951802528] [2021-11-12 23:21:13,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951802528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:13,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402086379] [2021-11-12 23:21:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:13,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:13,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:13,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:13,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-12 23:21:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:13,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-12 23:21:13,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-12 23:21:13,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-12 23:21:13,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402086379] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:13,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125269194] [2021-11-12 23:21:13,717 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:21:13,717 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:13,718 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:610) 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-12 23:21:13,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:13,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2021-11-12 23:21:13,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581765602] [2021-11-12 23:21:13,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:13,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-12 23:21:13,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-12 23:21:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:21:13,724 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-12 23:21:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:14,225 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2021-11-12 23:21:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:21:14,226 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 35 [2021-11-12 23:21:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:14,227 INFO L225 Difference]: With dead ends: 128 [2021-11-12 23:21:14,227 INFO L226 Difference]: Without dead ends: 123 [2021-11-12 23:21:14,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2021-11-12 23:21:14,229 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.51ms SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 206.92ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:14,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 90 Invalid, 368 Unknown, 0 Unchecked, 3.51ms Time], IncrementalHoareTripleChecker [66 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 206.92ms Time] [2021-11-12 23:21:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-12 23:21:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2021-11-12 23:21:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-12 23:21:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-11-12 23:21:14,236 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 35 [2021-11-12 23:21:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:14,236 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-11-12 23:21:14,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-12 23:21:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-11-12 23:21:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-12 23:21:14,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:14,243 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:14,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:14,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-12 23:21:14,456 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 442028402, now seen corresponding path program 2 times [2021-11-12 23:21:14,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:14,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811983580] [2021-11-12 23:21:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:14,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-12 23:21:14,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:14,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811983580] [2021-11-12 23:21:14,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811983580] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:14,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070141532] [2021-11-12 23:21:14,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:21:14,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:14,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:14,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:14,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-12 23:21:14,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-12 23:21:14,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:21:14,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-12 23:21:14,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-12 23:21:15,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 10 proven. 96 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-12 23:21:16,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070141532] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:16,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [49218388] [2021-11-12 23:21:16,230 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:21:16,231 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:16,231 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:610) 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-12 23:21:16,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:16,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2021-11-12 23:21:16,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303255607] [2021-11-12 23:21:16,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:16,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-12 23:21:16,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-12 23:21:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:21:16,237 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-12 23:21:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:17,015 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2021-11-12 23:21:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-12 23:21:17,016 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 62 [2021-11-12 23:21:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:17,018 INFO L225 Difference]: With dead ends: 139 [2021-11-12 23:21:17,018 INFO L226 Difference]: Without dead ends: 138 [2021-11-12 23:21:17,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2021-11-12 23:21:17,021 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 174 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 198.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.21ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 235.09ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:17,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 123 Invalid, 409 Unknown, 0 Unchecked, 4.21ms Time], IncrementalHoareTripleChecker [103 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 235.09ms Time] [2021-11-12 23:21:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-12 23:21:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 88. [2021-11-12 23:21:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2021-11-12 23:21:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-12 23:21:17,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 62 [2021-11-12 23:21:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:17,031 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-12 23:21:17,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-12 23:21:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-12 23:21:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-12 23:21:17,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:17,033 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:17,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:17,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:17,248 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -325154713, now seen corresponding path program 2 times [2021-11-12 23:21:17,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:17,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853418560] [2021-11-12 23:21:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:17,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:21:17,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:17,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853418560] [2021-11-12 23:21:17,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853418560] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:17,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161903243] [2021-11-12 23:21:17,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:21:17,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:17,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:17,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:17,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-12 23:21:17,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-12 23:21:17,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:21:17,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-12 23:21:17,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:21:17,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:21:17,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161903243] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:17,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [700039267] [2021-11-12 23:21:17,891 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:21:17,892 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:17,892 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:610) 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-12 23:21:17,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:17,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-12 23:21:17,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192979919] [2021-11-12 23:21:17,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:17,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:21:17,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:21:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:21:17,898 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-12 23:21:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:18,182 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2021-11-12 23:21:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-12 23:21:18,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2021-11-12 23:21:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:18,184 INFO L225 Difference]: With dead ends: 109 [2021-11-12 23:21:18,184 INFO L226 Difference]: Without dead ends: 104 [2021-11-12 23:21:18,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2021-11-12 23:21:18,186 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.97ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:18,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 131 Invalid, 204 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [46 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 113.97ms Time] [2021-11-12 23:21:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-12 23:21:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-11-12 23:21:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (22), 16 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-12 23:21:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-12 23:21:18,199 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 46 [2021-11-12 23:21:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:18,199 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-12 23:21:18,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-12 23:21:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-12 23:21:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-12 23:21:18,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:18,205 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:18,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:18,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-12 23:21:18,424 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash -674862935, now seen corresponding path program 3 times [2021-11-12 23:21:18,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:18,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229139280] [2021-11-12 23:21:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:18,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-12 23:21:18,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:18,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229139280] [2021-11-12 23:21:18,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229139280] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:18,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242031214] [2021-11-12 23:21:18,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:21:18,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:18,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:18,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-12 23:21:18,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:21:18,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:21:18,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-12 23:21:18,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-12 23:21:19,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-12 23:21:20,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242031214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:21:20,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592111778] [2021-11-12 23:21:20,139 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:21:20,139 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:20,140 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:610) 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-12 23:21:20,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:21:20,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 36 [2021-11-12 23:21:20,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890823003] [2021-11-12 23:21:20,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:20,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-12 23:21:20,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:20,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-12 23:21:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2021-11-12 23:21:20,143 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-12 23:21:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:21:21,705 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2021-11-12 23:21:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-12 23:21:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) Word has length 68 [2021-11-12 23:21:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:21:21,707 INFO L225 Difference]: With dead ends: 187 [2021-11-12 23:21:21,707 INFO L226 Difference]: Without dead ends: 176 [2021-11-12 23:21:21,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2021-11-12 23:21:21,711 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 472.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.84ms SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 565.95ms IncrementalHoareTripleChecker+Time [2021-11-12 23:21:21,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 189 Invalid, 1034 Unknown, 0 Unchecked, 6.84ms Time], IncrementalHoareTripleChecker [170 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 565.95ms Time] [2021-11-12 23:21:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-12 23:21:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2021-11-12 23:21:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.0546875) internal successors, (135), 127 states have internal predecessors, (135), 9 states have call successors, (9), 6 states have call predecessors, (9), 23 states have return successors, (33), 27 states have call predecessors, (33), 7 states have call successors, (33) [2021-11-12 23:21:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2021-11-12 23:21:21,723 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 68 [2021-11-12 23:21:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:21:21,724 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2021-11-12 23:21:21,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-12 23:21:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2021-11-12 23:21:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-12 23:21:21,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:21:21,726 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2021-11-12 23:21:21,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-12 23:21:21,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-12 23:21:21,947 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:21:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:21:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 147099220, now seen corresponding path program 3 times [2021-11-12 23:21:21,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:21:21,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349116929] [2021-11-12 23:21:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:21:21,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:21:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:21:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-12 23:21:22,277 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:21:22,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349116929] [2021-11-12 23:21:22,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349116929] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:21:22,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878507027] [2021-11-12 23:21:22,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:21:22,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:21:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:21:22,280 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:21:22,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-12 23:21:22,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:21:22,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:21:22,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-12 23:21:22,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:21:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-12 23:21:23,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:21:55,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_46] [2021-11-12 23:21:55,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2117164337] [2021-11-12 23:21:55,028 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:21:55,029 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:21:55,029 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:610) 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-12 23:21:55,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:21:55,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-12 23:21:55,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918693261] [2021-11-12 23:21:55,031 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:21:55,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:21:55,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:21:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:21:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1302, Unknown=9, NotChecked=0, Total=1482 [2021-11-12 23:21:55,034 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-12 23:22:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:22:00,427 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2021-11-12 23:22:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-12 23:22:00,428 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2021-11-12 23:22:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:22:00,430 INFO L225 Difference]: With dead ends: 230 [2021-11-12 23:22:00,430 INFO L226 Difference]: Without dead ends: 229 [2021-11-12 23:22:00,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=551, Invalid=4551, Unknown=10, NotChecked=0, Total=5112 [2021-11-12 23:22:00,434 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 135 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 798.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.82ms SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 933.99ms IncrementalHoareTripleChecker+Time [2021-11-12 23:22:00,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 315 Invalid, 1066 Unknown, 0 Unchecked, 9.82ms Time], IncrementalHoareTripleChecker [69 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 933.99ms Time] [2021-11-12 23:22:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-12 23:22:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2021-11-12 23:22:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 132 states have (on average 1.053030303030303) internal successors, (139), 131 states have internal predecessors, (139), 9 states have call successors, (9), 6 states have call predecessors, (9), 24 states have return successors, (35), 28 states have call predecessors, (35), 7 states have call successors, (35) [2021-11-12 23:22:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2021-11-12 23:22:00,452 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 94 [2021-11-12 23:22:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:22:00,453 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2021-11-12 23:22:00,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-12 23:22:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2021-11-12 23:22:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-12 23:22:00,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:22:00,456 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2021-11-12 23:22:00,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-12 23:22:00,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-12 23:22:00,671 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:22:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:22:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -584032592, now seen corresponding path program 4 times [2021-11-12 23:22:00,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:22:00,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990103491] [2021-11-12 23:22:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:22:00,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:22:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:22:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-11-12 23:22:01,261 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:22:01,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990103491] [2021-11-12 23:22:01,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990103491] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:22:01,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907794164] [2021-11-12 23:22:01,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:22:01,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:22:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:22:01,263 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:22:01,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-12 23:22:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:22:01,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-12 23:22:01,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:22:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-11-12 23:22:02,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:22:45,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_59] [2021-11-12 23:22:45,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1742027002] [2021-11-12 23:22:45,158 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:22:45,159 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:22:45,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:610) 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-12 23:22:45,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:22:45,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-12 23:22:45,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439650989] [2021-11-12 23:22:45,159 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:22:45,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-12 23:22:45,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:22:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-12 23:22:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1324, Unknown=18, NotChecked=0, Total=1482 [2021-11-12 23:22:45,161 INFO L87 Difference]: Start difference. First operand 166 states and 183 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-12 23:22:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:22:53,413 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2021-11-12 23:22:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-12 23:22:53,413 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) Word has length 117 [2021-11-12 23:22:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:22:53,415 INFO L225 Difference]: With dead ends: 253 [2021-11-12 23:22:53,415 INFO L226 Difference]: Without dead ends: 252 [2021-11-12 23:22:53,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=510, Invalid=5321, Unknown=21, NotChecked=0, Total=5852 [2021-11-12 23:22:53,418 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 150 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 811.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.28ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 916.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:22:53,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 367 Invalid, 1323 Unknown, 0 Unchecked, 8.28ms Time], IncrementalHoareTripleChecker [79 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 916.79ms Time] [2021-11-12 23:22:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-12 23:22:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 171. [2021-11-12 23:22:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.0514705882352942) internal successors, (143), 135 states have internal predecessors, (143), 9 states have call successors, (9), 6 states have call predecessors, (9), 25 states have return successors, (37), 29 states have call predecessors, (37), 7 states have call successors, (37) [2021-11-12 23:22:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2021-11-12 23:22:53,456 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 117 [2021-11-12 23:22:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:22:53,459 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2021-11-12 23:22:53,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-12 23:22:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2021-11-12 23:22:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-12 23:22:53,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:22:53,462 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2021-11-12 23:22:53,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-12 23:22:53,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-12 23:22:53,683 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:22:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:22:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -238126088, now seen corresponding path program 5 times [2021-11-12 23:22:53,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:22:53,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362344856] [2021-11-12 23:22:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:22:53,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:22:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:22:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-12 23:22:54,254 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:22:54,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362344856] [2021-11-12 23:22:54,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362344856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:22:54,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929816237] [2021-11-12 23:22:54,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:22:54,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:22:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:22:54,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:22:54,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-12 23:22:54,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-12 23:22:54,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:22:54,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-12 23:22:54,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:22:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-12 23:22:55,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:23:02,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_73] [2021-11-12 23:23:02,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956926628] [2021-11-12 23:23:02,585 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:23:02,586 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:23:02,586 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:610) 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-12 23:23:02,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:23:02,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-12 23:23:02,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360924196] [2021-11-12 23:23:02,588 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:23:02,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-12 23:23:02,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:02,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-12 23:23:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2021-11-12 23:23:02,590 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-12 23:23:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:05,331 INFO L93 Difference]: Finished difference Result 276 states and 306 transitions. [2021-11-12 23:23:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-12 23:23:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2021-11-12 23:23:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:05,334 INFO L225 Difference]: With dead ends: 276 [2021-11-12 23:23:05,334 INFO L226 Difference]: Without dead ends: 275 [2021-11-12 23:23:05,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=578, Invalid=6562, Unknown=0, NotChecked=0, Total=7140 [2021-11-12 23:23:05,337 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 165 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1017.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.25ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1137.90ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:05,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 423 Invalid, 1611 Unknown, 0 Unchecked, 9.25ms Time], IncrementalHoareTripleChecker [91 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1137.90ms Time] [2021-11-12 23:23:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-12 23:23:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 176. [2021-11-12 23:23:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 140 states have (on average 1.05) internal successors, (147), 139 states have internal predecessors, (147), 9 states have call successors, (9), 6 states have call predecessors, (9), 26 states have return successors, (39), 30 states have call predecessors, (39), 7 states have call successors, (39) [2021-11-12 23:23:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2021-11-12 23:23:05,352 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 128 [2021-11-12 23:23:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:05,353 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2021-11-12 23:23:05,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-12 23:23:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2021-11-12 23:23:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-12 23:23:05,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:05,355 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:23:05,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-12 23:23:05,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-12 23:23:05,567 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:23:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1830791249, now seen corresponding path program 4 times [2021-11-12 23:23:05,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:05,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614616153] [2021-11-12 23:23:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:05,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 121 proven. 81 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-12 23:23:05,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:05,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614616153] [2021-11-12 23:23:05,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614616153] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:23:05,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574782491] [2021-11-12 23:23:05,856 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:23:05,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:23:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:23:05,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:23:05,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-12 23:23:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:06,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-12 23:23:06,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:23:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 3 proven. 214 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-11-12 23:23:06,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:23:12,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_80] [2021-11-12 23:23:12,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1446968550] [2021-11-12 23:23:12,372 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:23:12,372 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:23:12,373 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:610) 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-12 23:23:12,374 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:23:12,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-12 23:23:12,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379902429] [2021-11-12 23:23:12,374 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:23:12,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-12 23:23:12,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-12 23:23:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1006, Unknown=1, NotChecked=0, Total=1122 [2021-11-12 23:23:12,376 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-12 23:23:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:13,542 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2021-11-12 23:23:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:23:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 90 [2021-11-12 23:23:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:13,544 INFO L225 Difference]: With dead ends: 201 [2021-11-12 23:23:13,545 INFO L226 Difference]: Without dead ends: 198 [2021-11-12 23:23:13,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=297, Invalid=2458, Unknown=1, NotChecked=0, Total=2756 [2021-11-12 23:23:13,547 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 451.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.01ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 502.43ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:13,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 294 Invalid, 603 Unknown, 0 Unchecked, 4.01ms Time], IncrementalHoareTripleChecker [37 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 502.43ms Time] [2021-11-12 23:23:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-12 23:23:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2021-11-12 23:23:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.0486111111111112) internal successors, (151), 143 states have internal predecessors, (151), 9 states have call successors, (9), 6 states have call predecessors, (9), 27 states have return successors, (40), 31 states have call predecessors, (40), 7 states have call successors, (40) [2021-11-12 23:23:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2021-11-12 23:23:13,559 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 90 [2021-11-12 23:23:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:13,560 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2021-11-12 23:23:13,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-12 23:23:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2021-11-12 23:23:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-12 23:23:13,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:13,563 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2021-11-12 23:23:13,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-12 23:23:13,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:23:13,775 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:23:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1565122770, now seen corresponding path program 6 times [2021-11-12 23:23:13,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:13,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972211457] [2021-11-12 23:23:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:13,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-11-12 23:23:14,597 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:14,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972211457] [2021-11-12 23:23:14,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972211457] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:23:14,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291995466] [2021-11-12 23:23:14,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:23:14,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:23:14,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:23:14,606 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:23:14,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-12 23:23:14,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:23:14,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:23:14,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-12 23:23:14,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:23:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-11-12 23:23:16,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:23:24,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_95] [2021-11-12 23:23:24,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794744345] [2021-11-12 23:23:24,901 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:23:24,901 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:23:24,901 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:610) 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-12 23:23:24,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:23:24,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-12 23:23:24,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764320756] [2021-11-12 23:23:24,903 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:23:24,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-12 23:23:24,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:23:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-12 23:23:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2021-11-12 23:23:24,905 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-12 23:23:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:23:28,258 INFO L93 Difference]: Finished difference Result 296 states and 329 transitions. [2021-11-12 23:23:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-12 23:23:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) Word has length 139 [2021-11-12 23:23:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:23:28,260 INFO L225 Difference]: With dead ends: 296 [2021-11-12 23:23:28,261 INFO L226 Difference]: Without dead ends: 295 [2021-11-12 23:23:28,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 136 SyntacticMatches, 9 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=628, Invalid=7744, Unknown=0, NotChecked=0, Total=8372 [2021-11-12 23:23:28,264 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 179 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1263.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.65ms SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1428.51ms IncrementalHoareTripleChecker+Time [2021-11-12 23:23:28,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 480 Invalid, 1888 Unknown, 0 Unchecked, 8.65ms Time], IncrementalHoareTripleChecker [99 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1428.51ms Time] [2021-11-12 23:23:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-12 23:23:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 186. [2021-11-12 23:23:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.0472972972972974) internal successors, (155), 147 states have internal predecessors, (155), 9 states have call successors, (9), 6 states have call predecessors, (9), 28 states have return successors, (42), 32 states have call predecessors, (42), 7 states have call successors, (42) [2021-11-12 23:23:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2021-11-12 23:23:28,281 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 139 [2021-11-12 23:23:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:23:28,281 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2021-11-12 23:23:28,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-12 23:23:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2021-11-12 23:23:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-12 23:23:28,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:23:28,284 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 10, 9, 9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:23:28,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-12 23:23:28,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:23:28,499 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:23:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:23:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -159119921, now seen corresponding path program 5 times [2021-11-12 23:23:28,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:23:28,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026144594] [2021-11-12 23:23:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:23:28,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:23:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:23:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 6 proven. 413 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-11-12 23:23:29,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:23:29,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026144594] [2021-11-12 23:23:29,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026144594] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:23:29,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130040476] [2021-11-12 23:23:29,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:23:29,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:23:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:23:29,202 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:23:29,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-12 23:23:29,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-12 23:23:29,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:23:29,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-12 23:23:29,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:23:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 131 proven. 282 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-12 23:23:31,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:23:48,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_BEFORE_CALL_68| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))))) is different from false [2021-11-12 23:23:52,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_BEFORE_CALL_68| Int)) (or (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))) (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-12 23:23:58,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_1317| Int) (|v_mult_#in~n_BEFORE_CALL_68| Int) (|v_mult_#in~n_1314| Int)) (or (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))) (< c_mult_~n |v_mult_#in~n_1314|) (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 (* 2 |v_mult_#in~n_1317|) c_mult_~n (* 3 |v_mult_#in~n_1314|)) 2147483647) (< |v_mult_#in~n_1314| |v_mult_#in~n_1317|))) is different from false [2021-11-12 23:24:00,075 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_1317| Int) (|v_mult_#in~n_BEFORE_CALL_68| Int) (|v_mult_#in~n_1314| Int)) (or (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))) (< c_mult_~n |v_mult_#in~n_1314|) (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 (* 2 |v_mult_#in~n_1317|) c_mult_~n (* 3 |v_mult_#in~n_1314|)) 2147483647) (< |v_mult_#in~n_1314| |v_mult_#in~n_1317|))) is different from true [2021-11-12 23:24:00,086 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_107, v_mult_~n_BEFORE_CALL_108, |v_mult_#in~n_BEFORE_CALL_68|] [2021-11-12 23:24:00,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064588923] [2021-11-12 23:24:00,088 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:24:00,088 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:24:00,089 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:610) 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-12 23:24:00,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:24:00,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-11-12 23:24:00,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463612427] [2021-11-12 23:24:00,090 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:24:00,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-12 23:24:00,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:24:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-12 23:24:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1574, Unknown=9, NotChecked=246, Total=1980 [2021-11-12 23:24:00,093 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-12 23:24:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:24:04,842 INFO L93 Difference]: Finished difference Result 247 states and 270 transitions. [2021-11-12 23:24:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-12 23:24:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 124 [2021-11-12 23:24:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:24:04,845 INFO L225 Difference]: With dead ends: 247 [2021-11-12 23:24:04,845 INFO L226 Difference]: Without dead ends: 244 [2021-11-12 23:24:04,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=571, Invalid=5131, Unknown=10, NotChecked=450, Total=6162 [2021-11-12 23:24:04,848 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 131 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 977.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.79ms SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1108.61ms IncrementalHoareTripleChecker+Time [2021-11-12 23:24:04,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 381 Invalid, 1742 Unknown, 0 Unchecked, 5.79ms Time], IncrementalHoareTripleChecker [93 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1108.61ms Time] [2021-11-12 23:24:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-12 23:24:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 191. [2021-11-12 23:24:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.0460526315789473) internal successors, (159), 151 states have internal predecessors, (159), 9 states have call successors, (9), 6 states have call predecessors, (9), 29 states have return successors, (43), 33 states have call predecessors, (43), 7 states have call successors, (43) [2021-11-12 23:24:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2021-11-12 23:24:04,861 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 124 [2021-11-12 23:24:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:24:04,862 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2021-11-12 23:24:04,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-12 23:24:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2021-11-12 23:24:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-12 23:24:04,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:24:04,865 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:24:04,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-11-12 23:24:05,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:24:05,091 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:24:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:24:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1432828361, now seen corresponding path program 6 times [2021-11-12 23:24:05,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:24:05,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002218918] [2021-11-12 23:24:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:24:05,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:24:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:24:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 145 proven. 113 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-12 23:24:05,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:24:05,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002218918] [2021-11-12 23:24:05,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002218918] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:24:05,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089178868] [2021-11-12 23:24:05,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:24:05,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:24:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:24:05,412 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:24:05,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-12 23:24:05,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:24:05,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:24:05,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-12 23:24:05,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:24:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 3 proven. 270 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-11-12 23:24:06,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:25:01,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_117, v_mult_~n_BEFORE_CALL_118, |aux_div_v_mult_#t~ret8_AFTER_RETURN_36_100|] [2021-11-12 23:25:01,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [776990466] [2021-11-12 23:25:01,417 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:25:01,417 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:25:01,418 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:610) 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-12 23:25:01,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:25:01,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-12 23:25:01,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351455432] [2021-11-12 23:25:01,419 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:25:01,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-12 23:25:01,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-12 23:25:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1519, Unknown=21, NotChecked=0, Total=1722 [2021-11-12 23:25:01,421 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-12 23:25:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:02,933 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2021-11-12 23:25:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-12 23:25:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 101 [2021-11-12 23:25:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:02,947 INFO L225 Difference]: With dead ends: 221 [2021-11-12 23:25:02,948 INFO L226 Difference]: Without dead ends: 218 [2021-11-12 23:25:02,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=463, Invalid=3676, Unknown=21, NotChecked=0, Total=4160 [2021-11-12 23:25:02,949 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 81 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 551.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.60ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 623.75ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:02,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 366 Invalid, 830 Unknown, 0 Unchecked, 3.60ms Time], IncrementalHoareTripleChecker [44 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 623.75ms Time] [2021-11-12 23:25:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-12 23:25:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 196. [2021-11-12 23:25:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 156 states have (on average 1.044871794871795) internal successors, (163), 155 states have internal predecessors, (163), 9 states have call successors, (9), 6 states have call predecessors, (9), 30 states have return successors, (44), 34 states have call predecessors, (44), 7 states have call successors, (44) [2021-11-12 23:25:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2021-11-12 23:25:02,962 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 101 [2021-11-12 23:25:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:02,963 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2021-11-12 23:25:02,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-12 23:25:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2021-11-12 23:25:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-12 23:25:02,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:02,966 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2021-11-12 23:25:02,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-12 23:25:03,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-12 23:25:03,179 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:25:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1604616104, now seen corresponding path program 7 times [2021-11-12 23:25:03,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:03,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312633446] [2021-11-12 23:25:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:03,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2021-11-12 23:25:03,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:03,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312633446] [2021-11-12 23:25:03,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312633446] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:25:03,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744888725] [2021-11-12 23:25:03,986 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:25:03,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:25:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:25:03,987 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:25:03,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-12 23:25:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-12 23:25:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:25:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2021-11-12 23:25:06,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:25:24,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_132] [2021-11-12 23:25:24,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751758654] [2021-11-12 23:25:24,996 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:25:24,996 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:25:24,996 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:610) 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-12 23:25:24,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:25:24,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-12 23:25:24,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570710498] [2021-11-12 23:25:24,998 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:25:24,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-12 23:25:24,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-12 23:25:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2077, Unknown=3, NotChecked=0, Total=2256 [2021-11-12 23:25:24,999 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-12 23:25:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:28,798 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2021-11-12 23:25:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-12 23:25:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) Word has length 138 [2021-11-12 23:25:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:28,801 INFO L225 Difference]: With dead ends: 316 [2021-11-12 23:25:28,801 INFO L226 Difference]: Without dead ends: 315 [2021-11-12 23:25:28,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=678, Invalid=9021, Unknown=3, NotChecked=0, Total=9702 [2021-11-12 23:25:28,804 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 192 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1468.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.55ms SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1640.07ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:28,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 544 Invalid, 2203 Unknown, 0 Unchecked, 8.55ms Time], IncrementalHoareTripleChecker [108 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1640.07ms Time] [2021-11-12 23:25:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-12 23:25:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2021-11-12 23:25:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.04375) internal successors, (167), 159 states have internal predecessors, (167), 9 states have call successors, (9), 6 states have call predecessors, (9), 31 states have return successors, (46), 35 states have call predecessors, (46), 7 states have call successors, (46) [2021-11-12 23:25:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2021-11-12 23:25:28,818 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 138 [2021-11-12 23:25:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:28,819 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2021-11-12 23:25:28,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-12 23:25:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2021-11-12 23:25:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-12 23:25:28,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:28,822 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:25:28,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-12 23:25:29,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-12 23:25:29,036 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:25:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 380679577, now seen corresponding path program 7 times [2021-11-12 23:25:29,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:29,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622607773] [2021-11-12 23:25:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:29,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 2 proven. 370 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-11-12 23:25:29,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:29,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622607773] [2021-11-12 23:25:29,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622607773] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:25:29,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027130285] [2021-11-12 23:25:29,796 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:25:29,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:25:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:25:29,797 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:25:29,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-12 23:25:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:30,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-12 23:25:30,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:25:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 2 proven. 370 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-11-12 23:25:31,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:25:35,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_143] [2021-11-12 23:25:35,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727014855] [2021-11-12 23:25:35,718 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:25:35,718 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:25:35,719 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:610) 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-12 23:25:35,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:25:35,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-11-12 23:25:35,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875044226] [2021-11-12 23:25:35,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:25:35,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-12 23:25:35,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:25:35,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-12 23:25:35,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2021-11-12 23:25:35,726 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-12 23:25:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:25:38,724 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2021-11-12 23:25:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-12 23:25:38,725 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) Word has length 123 [2021-11-12 23:25:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:25:38,726 INFO L225 Difference]: With dead ends: 267 [2021-11-12 23:25:38,727 INFO L226 Difference]: Without dead ends: 264 [2021-11-12 23:25:38,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=578, Invalid=5742, Unknown=0, NotChecked=0, Total=6320 [2021-11-12 23:25:38,728 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 144 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1326.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.17ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1489.77ms IncrementalHoareTripleChecker+Time [2021-11-12 23:25:38,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 481 Invalid, 2213 Unknown, 0 Unchecked, 7.17ms Time], IncrementalHoareTripleChecker [105 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1489.77ms Time] [2021-11-12 23:25:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-12 23:25:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 206. [2021-11-12 23:25:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.0426829268292683) internal successors, (171), 163 states have internal predecessors, (171), 9 states have call successors, (9), 6 states have call predecessors, (9), 32 states have return successors, (47), 36 states have call predecessors, (47), 7 states have call successors, (47) [2021-11-12 23:25:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2021-11-12 23:25:38,741 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 123 [2021-11-12 23:25:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:25:38,742 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2021-11-12 23:25:38,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-12 23:25:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2021-11-12 23:25:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-12 23:25:38,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:25:38,744 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 9, 9, 9, 9, 9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:25:38,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-12 23:25:38,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-12 23:25:38,959 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:25:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:25:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1867209457, now seen corresponding path program 8 times [2021-11-12 23:25:38,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:25:38,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390522327] [2021-11-12 23:25:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:25:38,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:25:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:25:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 169 proven. 150 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-12 23:25:39,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:25:39,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390522327] [2021-11-12 23:25:39,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390522327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:25:39,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347890610] [2021-11-12 23:25:39,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:25:39,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:25:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:25:39,388 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:25:39,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-12 23:25:39,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-12 23:25:39,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:25:39,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-12 23:25:39,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:25:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 169 proven. 150 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-12 23:25:40,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:26:03,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_152] [2021-11-12 23:26:03,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2085834017] [2021-11-12 23:26:03,928 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:26:03,928 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:26:03,929 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:610) 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-12 23:26:03,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:26:03,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-11-12 23:26:03,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534965216] [2021-11-12 23:26:03,930 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:26:03,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:26:03,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:26:03,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:26:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=931, Unknown=9, NotChecked=0, Total=1056 [2021-11-12 23:26:03,932 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-12 23:26:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:26:06,047 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2021-11-12 23:26:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-12 23:26:06,048 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 112 [2021-11-12 23:26:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:26:06,050 INFO L225 Difference]: With dead ends: 241 [2021-11-12 23:26:06,050 INFO L226 Difference]: Without dead ends: 238 [2021-11-12 23:26:06,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=374, Invalid=3157, Unknown=9, NotChecked=0, Total=3540 [2021-11-12 23:26:06,051 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 648.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.78ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 722.53ms IncrementalHoareTripleChecker+Time [2021-11-12 23:26:06,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 449 Invalid, 1104 Unknown, 0 Unchecked, 3.78ms Time], IncrementalHoareTripleChecker [51 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 722.53ms Time] [2021-11-12 23:26:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-12 23:26:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 211. [2021-11-12 23:26:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.0416666666666667) internal successors, (175), 167 states have internal predecessors, (175), 9 states have call successors, (9), 6 states have call predecessors, (9), 33 states have return successors, (48), 37 states have call predecessors, (48), 7 states have call successors, (48) [2021-11-12 23:26:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2021-11-12 23:26:06,063 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 112 [2021-11-12 23:26:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:26:06,064 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2021-11-12 23:26:06,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-12 23:26:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2021-11-12 23:26:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-12 23:26:06,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:26:06,066 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2021-11-12 23:26:06,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-12 23:26:06,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:26:06,287 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:26:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:26:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1727115348, now seen corresponding path program 8 times [2021-11-12 23:26:06,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:26:06,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064286229] [2021-11-12 23:26:06,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:26:06,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:26:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:26:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2021-11-12 23:26:07,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:26:07,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064286229] [2021-11-12 23:26:07,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064286229] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:26:07,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313965247] [2021-11-12 23:26:07,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:26:07,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:26:07,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:26:07,271 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:26:07,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-12 23:26:07,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-12 23:26:07,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:26:07,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-12 23:26:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:26:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2021-11-12 23:26:09,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:26:49,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_169 Int) (v_mult_~n_BEFORE_CALL_170 Int) (|v_mult_#in~n_BEFORE_CALL_118| Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_169_58 Int) (|v_mult_#in~n_2536| Int) (|v_mult_#in~n_2533| Int) (aux_div_v_mult_~n_BEFORE_CALL_169_58 Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_BEFORE_CALL_118|) 2147483647) (forall ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (or (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_2328|)) (< |v_mult_#in~n_2335| |v_mult_#in~n_2337|) (< |v_mult_#in~n_2328| |v_mult_#in~n_2335|) (<= (+ (* 5 |v_mult_#in~n_2337|) 2147483647 (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (* 4 aux_div_v_mult_~n_BEFORE_CALL_169_58))))) (<= |v_mult_#in~n_2536| |v_mult_#in~n_2533|) (< aux_mod_v_mult_~n_BEFORE_CALL_169_58 2) (<= |v_mult_#in~n_2533| v_mult_~n_BEFORE_CALL_170) (< aux_div_v_mult_~n_BEFORE_CALL_169_58 (+ v_mult_~n_BEFORE_CALL_170 (* 3 |v_mult_#in~n_2533|) (* 2 |v_mult_#in~n_2536|))))) (exists ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (and (<= |v_mult_#in~n_2337| |v_mult_#in~n_2335|) (<= |v_mult_#in~n_2335| |v_mult_#in~n_2328|) (<= |v_mult_#in~n_2328| v_mult_~n_BEFORE_CALL_169) (< 2147483647 (+ (* 5 |v_mult_#in~n_2337|) (* 2 v_mult_~n_BEFORE_CALL_169) (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|))))) (< v_mult_~n_BEFORE_CALL_170 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_170 v_mult_~n_BEFORE_CALL_169 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_169 |v_mult_#in~n_BEFORE_CALL_118|))) is different from false [2021-11-12 23:26:57,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_169 Int) (v_mult_~n_BEFORE_CALL_170 Int) (|v_mult_#in~n_BEFORE_CALL_118| Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_169_58 Int) (|v_mult_#in~n_2536| Int) (|v_mult_#in~n_2533| Int) (aux_div_v_mult_~n_BEFORE_CALL_169_58 Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_BEFORE_CALL_118|) 2147483647) (forall ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (or (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_2328|)) (< |v_mult_#in~n_2335| |v_mult_#in~n_2337|) (< |v_mult_#in~n_2328| |v_mult_#in~n_2335|) (<= (+ (* 5 |v_mult_#in~n_2337|) 2147483647 (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (* 4 aux_div_v_mult_~n_BEFORE_CALL_169_58))))) (<= |v_mult_#in~n_2536| |v_mult_#in~n_2533|) (< aux_mod_v_mult_~n_BEFORE_CALL_169_58 2) (<= |v_mult_#in~n_2533| v_mult_~n_BEFORE_CALL_170) (< aux_div_v_mult_~n_BEFORE_CALL_169_58 (+ v_mult_~n_BEFORE_CALL_170 (* 3 |v_mult_#in~n_2533|) (* 2 |v_mult_#in~n_2536|))))) (exists ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (and (<= |v_mult_#in~n_2337| |v_mult_#in~n_2335|) (<= |v_mult_#in~n_2335| |v_mult_#in~n_2328|) (<= |v_mult_#in~n_2328| v_mult_~n_BEFORE_CALL_169) (< 2147483647 (+ (* 5 |v_mult_#in~n_2337|) (* 2 v_mult_~n_BEFORE_CALL_169) (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|))))) (< v_mult_~n_BEFORE_CALL_170 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_170 v_mult_~n_BEFORE_CALL_169 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_169 |v_mult_#in~n_BEFORE_CALL_118|))) is different from false [2021-11-12 23:27:11,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_169 Int) (v_mult_~n_BEFORE_CALL_170 Int) (|v_mult_#in~n_2704| Int) (|v_mult_#in~n_2702| Int) (|v_mult_#in~n_2700| Int) (|v_mult_#in~n_BEFORE_CALL_118| Int)) (or (exists ((aux_mod_v_mult_~n_BEFORE_CALL_169_58 Int) (|v_mult_#in~n_2536| Int) (|v_mult_#in~n_2533| Int) (aux_div_v_mult_~n_BEFORE_CALL_169_58 Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_BEFORE_CALL_118|) 2147483647) (forall ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (or (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_169_58 (* 2 aux_div_v_mult_~n_BEFORE_CALL_169_58) |v_mult_#in~n_2328|)) (< |v_mult_#in~n_2335| |v_mult_#in~n_2337|) (< |v_mult_#in~n_2328| |v_mult_#in~n_2335|) (<= (+ (* 5 |v_mult_#in~n_2337|) 2147483647 (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_169_58) (* 4 aux_div_v_mult_~n_BEFORE_CALL_169_58))))) (<= |v_mult_#in~n_2536| |v_mult_#in~n_2533|) (< aux_mod_v_mult_~n_BEFORE_CALL_169_58 2) (<= |v_mult_#in~n_2533| v_mult_~n_BEFORE_CALL_170) (< aux_div_v_mult_~n_BEFORE_CALL_169_58 (+ v_mult_~n_BEFORE_CALL_170 (* 3 |v_mult_#in~n_2533|) (* 2 |v_mult_#in~n_2536|))))) (< |v_mult_#in~n_2700| |v_mult_#in~n_2704|) (<= (+ v_mult_~n_BEFORE_CALL_170 v_mult_~n_BEFORE_CALL_169 (* 4 |v_mult_#in~n_2702|) (* 2 c_mult_~n) (* 3 |v_mult_#in~n_2704|) (* 2 |v_mult_#in~n_2700|)) 2147483647) (exists ((|v_mult_#in~n_2328| Int) (|v_mult_#in~n_2337| Int) (|v_mult_#in~n_2335| Int)) (and (<= |v_mult_#in~n_2337| |v_mult_#in~n_2335|) (<= |v_mult_#in~n_2335| |v_mult_#in~n_2328|) (<= |v_mult_#in~n_2328| v_mult_~n_BEFORE_CALL_169) (< 2147483647 (+ (* 5 |v_mult_#in~n_2337|) (* 2 v_mult_~n_BEFORE_CALL_169) (* 2 |v_mult_#in~n_2335|) (* 4 |v_mult_#in~n_2328|))))) (< v_mult_~n_BEFORE_CALL_170 |c_mult_#in~n|) (< |v_mult_#in~n_2702| |v_mult_#in~n_2700|) (< c_mult_~n |v_mult_#in~n_2702|) (< v_mult_~n_BEFORE_CALL_169 |v_mult_#in~n_BEFORE_CALL_118|))) is different from false [2021-11-12 23:27:12,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_169, v_mult_~n_BEFORE_CALL_170, |v_mult_#in~n_BEFORE_CALL_118|] [2021-11-12 23:27:12,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092031186] [2021-11-12 23:27:12,664 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:27:12,664 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:27:12,664 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:610) 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-12 23:27:12,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:27:12,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-12 23:27:12,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393420212] [2021-11-12 23:27:12,665 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:27:12,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-12 23:27:12,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-12 23:27:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2365, Unknown=3, NotChecked=300, Total=2862 [2021-11-12 23:27:12,667 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-12 23:27:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:16,490 INFO L93 Difference]: Finished difference Result 336 states and 371 transitions. [2021-11-12 23:27:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-12 23:27:16,491 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) Word has length 161 [2021-11-12 23:27:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:16,493 INFO L225 Difference]: With dead ends: 336 [2021-11-12 23:27:16,493 INFO L226 Difference]: Without dead ends: 335 [2021-11-12 23:27:16,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 159 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=734, Invalid=10405, Unknown=3, NotChecked=630, Total=11772 [2021-11-12 23:27:16,496 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 205 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1470.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.89ms SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1638.25ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:16,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 612 Invalid, 2540 Unknown, 0 Unchecked, 7.89ms Time], IncrementalHoareTripleChecker [115 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 1638.25ms Time] [2021-11-12 23:27:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-12 23:27:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 216. [2021-11-12 23:27:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 172 states have (on average 1.0406976744186047) internal successors, (179), 171 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 34 states have return successors, (50), 38 states have call predecessors, (50), 7 states have call successors, (50) [2021-11-12 23:27:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2021-11-12 23:27:16,510 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 161 [2021-11-12 23:27:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:16,510 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2021-11-12 23:27:16,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-12 23:27:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2021-11-12 23:27:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-12 23:27:16,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:16,525 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 13, 13, 12, 11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:27:16,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-12 23:27:16,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-12 23:27:16,751 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:27:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash -83496815, now seen corresponding path program 9 times [2021-11-12 23:27:16,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:16,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712580723] [2021-11-12 23:27:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:16,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 6 proven. 564 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-12 23:27:17,443 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:17,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712580723] [2021-11-12 23:27:17,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712580723] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:27:17,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832188787] [2021-11-12 23:27:17,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:27:17,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:27:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:27:17,445 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:27:17,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-12 23:27:17,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:27:17,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:27:17,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-12 23:27:17,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:27:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 6 proven. 564 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-12 23:27:19,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:27:25,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_184] [2021-11-12 23:27:25,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [504012951] [2021-11-12 23:27:25,003 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:27:25,003 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:27:25,003 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:610) 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-12 23:27:25,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:27:25,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-11-12 23:27:25,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854269295] [2021-11-12 23:27:25,005 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:27:25,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-12 23:27:25,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-12 23:27:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2021-11-12 23:27:25,007 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-12 23:27:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:28,318 INFO L93 Difference]: Finished difference Result 287 states and 312 transitions. [2021-11-12 23:27:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-12 23:27:28,318 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 146 [2021-11-12 23:27:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:28,320 INFO L225 Difference]: With dead ends: 287 [2021-11-12 23:27:28,320 INFO L226 Difference]: Without dead ends: 284 [2021-11-12 23:27:28,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 146 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=635, Invalid=6847, Unknown=0, NotChecked=0, Total=7482 [2021-11-12 23:27:28,322 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 157 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1411.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.93ms SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1583.96ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:28,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 552 Invalid, 2536 Unknown, 0 Unchecked, 6.93ms Time], IncrementalHoareTripleChecker [115 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1583.96ms Time] [2021-11-12 23:27:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-12 23:27:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 221. [2021-11-12 23:27:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.0397727272727273) internal successors, (183), 175 states have internal predecessors, (183), 9 states have call successors, (9), 6 states have call predecessors, (9), 35 states have return successors, (51), 39 states have call predecessors, (51), 7 states have call successors, (51) [2021-11-12 23:27:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2021-11-12 23:27:28,335 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 146 [2021-11-12 23:27:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:28,335 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2021-11-12 23:27:28,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-12 23:27:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2021-11-12 23:27:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-12 23:27:28,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:28,338 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:27:28,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-12 23:27:28,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-12 23:27:28,563 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:27:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -67197575, now seen corresponding path program 10 times [2021-11-12 23:27:28,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:28,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236744728] [2021-11-12 23:27:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:28,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 193 proven. 192 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-11-12 23:27:29,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:29,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236744728] [2021-11-12 23:27:29,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236744728] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:27:29,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469344569] [2021-11-12 23:27:29,070 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:27:29,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:27:29,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:27:29,076 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:27:29,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-12 23:27:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:29,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-12 23:27:29,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:27:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 3 proven. 397 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-11-12 23:27:30,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:27:34,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_194] [2021-11-12 23:27:34,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260367025] [2021-11-12 23:27:34,329 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:27:34,329 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:27:34,329 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:610) 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-12 23:27:34,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:27:34,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-12 23:27:34,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226387936] [2021-11-12 23:27:34,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:27:34,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:27:34,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:27:34,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:27:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1655, Unknown=0, NotChecked=0, Total=1806 [2021-11-12 23:27:34,333 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-12 23:27:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:27:36,264 INFO L93 Difference]: Finished difference Result 261 states and 283 transitions. [2021-11-12 23:27:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-12 23:27:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 123 [2021-11-12 23:27:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:27:36,266 INFO L225 Difference]: With dead ends: 261 [2021-11-12 23:27:36,266 INFO L226 Difference]: Without dead ends: 258 [2021-11-12 23:27:36,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=447, Invalid=4955, Unknown=0, NotChecked=0, Total=5402 [2021-11-12 23:27:36,268 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 809.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.49ms SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 905.21ms IncrementalHoareTripleChecker+Time [2021-11-12 23:27:36,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 537 Invalid, 1404 Unknown, 0 Unchecked, 4.49ms Time], IncrementalHoareTripleChecker [58 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 905.21ms Time] [2021-11-12 23:27:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-12 23:27:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 226. [2021-11-12 23:27:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.038888888888889) internal successors, (187), 179 states have internal predecessors, (187), 9 states have call successors, (9), 6 states have call predecessors, (9), 36 states have return successors, (52), 40 states have call predecessors, (52), 7 states have call successors, (52) [2021-11-12 23:27:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2021-11-12 23:27:36,280 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 123 [2021-11-12 23:27:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:27:36,281 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2021-11-12 23:27:36,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-12 23:27:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2021-11-12 23:27:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-12 23:27:36,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:27:36,283 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2021-11-12 23:27:36,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-12 23:27:36,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-12 23:27:36,502 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:27:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:27:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash 303260412, now seen corresponding path program 9 times [2021-11-12 23:27:36,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:27:36,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133977583] [2021-11-12 23:27:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:27:36,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:27:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:27:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 711 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-11-12 23:27:37,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:27:37,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133977583] [2021-11-12 23:27:37,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133977583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:27:37,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211138993] [2021-11-12 23:27:37,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:27:37,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:27:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:27:37,505 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:27:37,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-12 23:27:38,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:27:38,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:27:38,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-12 23:27:38,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:27:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 711 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-11-12 23:27:40,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:28:07,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_212 Int) (v_mult_~n_BEFORE_CALL_213 Int) (|v_mult_#in~n_BEFORE_CALL_151| Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int) (|v_mult_#in~n_3608| Int) (aux_mod_v_mult_~n_BEFORE_CALL_212_76 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int)) (let ((.cse0 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44)) (.cse1 (* 5 v_mult_~n_BEFORE_CALL_213)) (.cse2 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44))) (and (<= |v_mult_#in~n_3608| v_mult_~n_BEFORE_CALL_213) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 |v_mult_#in~n_BEFORE_CALL_151| .cse2) 2147483647) (<= 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 .cse2 (div (+ (* aux_mod_v_mult_~n_BEFORE_CALL_212_76 5) (- 9663676412) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 20) (* v_mult_~n_BEFORE_CALL_213 25) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 10)) 2))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 2) (< aux_mod_v_mult_~n_BEFORE_CALL_212_76 2) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 (* 2 |v_mult_#in~n_3608|)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_212_76)))) (< (div (+ (* v_mult_~n_BEFORE_CALL_212 (- 5)) 1073741823) 2) v_mult_~n_BEFORE_CALL_212) (< v_mult_~n_BEFORE_CALL_213 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_212 |v_mult_#in~n_BEFORE_CALL_151|) (<= (+ v_mult_~n_BEFORE_CALL_213 v_mult_~n_BEFORE_CALL_212 |c_mult_#res|) 2147483647))) is different from false [2021-11-12 23:28:11,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_212 Int) (v_mult_~n_BEFORE_CALL_213 Int) (|v_mult_#in~n_BEFORE_CALL_151| Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int) (|v_mult_#in~n_3608| Int) (aux_mod_v_mult_~n_BEFORE_CALL_212_76 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int)) (let ((.cse0 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44)) (.cse1 (* 5 v_mult_~n_BEFORE_CALL_213)) (.cse2 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44))) (and (<= |v_mult_#in~n_3608| v_mult_~n_BEFORE_CALL_213) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 |v_mult_#in~n_BEFORE_CALL_151| .cse2) 2147483647) (<= 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 .cse2 (div (+ (* aux_mod_v_mult_~n_BEFORE_CALL_212_76 5) (- 9663676412) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 20) (* v_mult_~n_BEFORE_CALL_213 25) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 10)) 2))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 2) (< aux_mod_v_mult_~n_BEFORE_CALL_212_76 2) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 (* 2 |v_mult_#in~n_3608|)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_212_76)))) (< (div (+ (* v_mult_~n_BEFORE_CALL_212 (- 5)) 1073741823) 2) v_mult_~n_BEFORE_CALL_212) (< v_mult_~n_BEFORE_CALL_213 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_213 v_mult_~n_BEFORE_CALL_212 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_212 |v_mult_#in~n_BEFORE_CALL_151|))) is different from false [2021-11-12 23:28:20,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_212_142 Int) (v_mult_~n_BEFORE_CALL_213 Int) (|v_mult_#in~n_3806| Int) (|v_mult_#in~n_3805| Int) (|v_mult_#in~n_BEFORE_CALL_151| Int) (aux_div_v_mult_~n_BEFORE_CALL_212_142 Int)) (let ((.cse3 (* 3 c_mult_~n)) (.cse4 (* 2 aux_div_v_mult_~n_BEFORE_CALL_212_142)) (.cse5 (* 3 |v_mult_#in~n_3805|))) (or (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_212_142) (< aux_mod_v_mult_~n_BEFORE_CALL_212_142 0) (<= (+ (* 2 |v_mult_#in~n_3806|) c_mult_~n) aux_div_v_mult_~n_BEFORE_CALL_212_142) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int) (|v_mult_#in~n_3608| Int) (aux_mod_v_mult_~n_BEFORE_CALL_212_76 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int)) (let ((.cse0 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44)) (.cse1 (* 5 v_mult_~n_BEFORE_CALL_213)) (.cse2 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44))) (and (<= |v_mult_#in~n_3608| v_mult_~n_BEFORE_CALL_213) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 |v_mult_#in~n_BEFORE_CALL_151| .cse2) 2147483647) (<= 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 .cse2 (div (+ (* aux_mod_v_mult_~n_BEFORE_CALL_212_76 5) (- 9663676412) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 20) (* v_mult_~n_BEFORE_CALL_213 25) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 10)) 2))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 2) (< aux_mod_v_mult_~n_BEFORE_CALL_212_76 2) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 (* 2 |v_mult_#in~n_3608|)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_212_76)))) (< |v_mult_#in~n_3805| |v_mult_#in~n_3806|) (< (+ v_mult_~n_BEFORE_CALL_213 aux_mod_v_mult_~n_BEFORE_CALL_212_142 .cse3 .cse4 .cse5 (div (+ (- 9663676412) (* v_mult_~n_BEFORE_CALL_213 5) (* aux_mod_v_mult_~n_BEFORE_CALL_212_142 5) (* c_mult_~n 15) (* aux_div_v_mult_~n_BEFORE_CALL_212_142 10) (* |v_mult_#in~n_3805| 15)) 2)) 2147483647) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_213 aux_mod_v_mult_~n_BEFORE_CALL_212_142 .cse3 |v_mult_#in~n_BEFORE_CALL_151| .cse4 .cse5)) (< v_mult_~n_BEFORE_CALL_213 |c_mult_#in~n|) (< c_mult_~n |v_mult_#in~n_3805|)))) is different from false [2021-11-12 23:28:22,764 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_212_142 Int) (v_mult_~n_BEFORE_CALL_213 Int) (|v_mult_#in~n_3806| Int) (|v_mult_#in~n_3805| Int) (|v_mult_#in~n_BEFORE_CALL_151| Int) (aux_div_v_mult_~n_BEFORE_CALL_212_142 Int)) (let ((.cse3 (* 3 c_mult_~n)) (.cse4 (* 2 aux_div_v_mult_~n_BEFORE_CALL_212_142)) (.cse5 (* 3 |v_mult_#in~n_3805|))) (or (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_212_142) (< aux_mod_v_mult_~n_BEFORE_CALL_212_142 0) (<= (+ (* 2 |v_mult_#in~n_3806|) c_mult_~n) aux_div_v_mult_~n_BEFORE_CALL_212_142) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int) (|v_mult_#in~n_3608| Int) (aux_mod_v_mult_~n_BEFORE_CALL_212_76 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 Int)) (let ((.cse0 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44)) (.cse1 (* 5 v_mult_~n_BEFORE_CALL_213)) (.cse2 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44))) (and (<= |v_mult_#in~n_3608| v_mult_~n_BEFORE_CALL_213) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 |v_mult_#in~n_BEFORE_CALL_151| .cse2) 2147483647) (<= 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_212_76 .cse0 .cse1 .cse2 (div (+ (* aux_mod_v_mult_~n_BEFORE_CALL_212_76 5) (- 9663676412) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 20) (* v_mult_~n_BEFORE_CALL_213 25) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 10)) 2))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 2) (< aux_mod_v_mult_~n_BEFORE_CALL_212_76 2) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_212_76_44) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_212_76_44 (* 2 |v_mult_#in~n_3608|)) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_212_76)))) (< |v_mult_#in~n_3805| |v_mult_#in~n_3806|) (< (+ v_mult_~n_BEFORE_CALL_213 aux_mod_v_mult_~n_BEFORE_CALL_212_142 .cse3 .cse4 .cse5 (div (+ (- 9663676412) (* v_mult_~n_BEFORE_CALL_213 5) (* aux_mod_v_mult_~n_BEFORE_CALL_212_142 5) (* c_mult_~n 15) (* aux_div_v_mult_~n_BEFORE_CALL_212_142 10) (* |v_mult_#in~n_3805| 15)) 2)) 2147483647) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_213 aux_mod_v_mult_~n_BEFORE_CALL_212_142 .cse3 |v_mult_#in~n_BEFORE_CALL_151| .cse4 .cse5)) (< v_mult_~n_BEFORE_CALL_213 |c_mult_#in~n|) (< c_mult_~n |v_mult_#in~n_3805|)))) is different from true [2021-11-12 23:28:22,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_213, |v_mult_#in~n_BEFORE_CALL_151|] [2021-11-12 23:28:22,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184576722] [2021-11-12 23:28:22,775 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:28:22,775 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:28:22,775 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:610) 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-12 23:28:22,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:28:22,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2021-11-12 23:28:22,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324365529] [2021-11-12 23:28:22,776 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:28:22,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-12 23:28:22,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:28:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-12 23:28:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2659, Unknown=9, NotChecked=318, Total=3192 [2021-11-12 23:28:22,777 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-12 23:28:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:28:29,149 INFO L93 Difference]: Finished difference Result 356 states and 392 transitions. [2021-11-12 23:28:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-12 23:28:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) Word has length 172 [2021-11-12 23:28:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:28:29,152 INFO L225 Difference]: With dead ends: 356 [2021-11-12 23:28:29,152 INFO L226 Difference]: Without dead ends: 355 [2021-11-12 23:28:29,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 169 SyntacticMatches, 12 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=784, Invalid=11874, Unknown=10, NotChecked=672, Total=13340 [2021-11-12 23:28:29,154 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 218 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 2779 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1699.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.22ms SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1903.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:28:29,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 684 Invalid, 2902 Unknown, 0 Unchecked, 8.22ms Time], IncrementalHoareTripleChecker [123 Valid, 2779 Invalid, 0 Unknown, 0 Unchecked, 1903.79ms Time] [2021-11-12 23:28:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-12 23:28:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 231. [2021-11-12 23:28:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 184 states have (on average 1.0380434782608696) internal successors, (191), 183 states have internal predecessors, (191), 9 states have call successors, (9), 6 states have call predecessors, (9), 37 states have return successors, (54), 41 states have call predecessors, (54), 7 states have call successors, (54) [2021-11-12 23:28:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2021-11-12 23:28:29,183 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 172 [2021-11-12 23:28:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:28:29,184 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2021-11-12 23:28:29,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-12 23:28:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2021-11-12 23:28:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-12 23:28:29,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:28:29,186 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 14, 14, 14, 14, 13, 12, 12, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:28:29,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-12 23:28:29,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-12 23:28:29,407 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:28:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:28:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1724251915, now seen corresponding path program 11 times [2021-11-12 23:28:29,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:28:29,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319638152] [2021-11-12 23:28:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:28:29,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:28:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:28:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 6 proven. 647 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2021-11-12 23:28:30,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:28:30,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319638152] [2021-11-12 23:28:30,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319638152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:28:30,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570130131] [2021-11-12 23:28:30,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:28:30,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:28:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:28:30,159 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:28:30,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-12 23:28:30,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-12 23:28:30,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:28:30,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-12 23:28:30,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:28:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 173 proven. 474 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2021-11-12 23:28:32,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:29:38,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_228 Int) (|v_mult_#in~n_BEFORE_CALL_163| Int) (v_mult_~n_BEFORE_CALL_229 Int)) (or (< v_mult_~n_BEFORE_CALL_229 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_228 |v_mult_#in~n_BEFORE_CALL_163|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_228_106 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (|v_mult_#in~n_4118| Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_228_106) (< aux_mod_v_mult_~n_BEFORE_CALL_228_106 2) (<= |v_mult_#in~n_4118| v_mult_~n_BEFORE_CALL_229) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 |v_mult_#in~n_4118|) (<= (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 |v_mult_#in~n_BEFORE_CALL_163| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|)) 2147483647) (forall ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (or (< |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (<= (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (div (+ (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 4) v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2) (* |v_mult_#in~n_4118| 5)) 2)) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) |v_mult_#in~n_3982| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|))))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2))) (exists ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* v_mult_~n_BEFORE_CALL_228 (- 1))) 2) (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|)) (<= |v_mult_#in~n_3982| v_mult_~n_BEFORE_CALL_228) (<= |v_mult_#in~n_3980| |v_mult_#in~n_3982|))) (<= (+ v_mult_~n_BEFORE_CALL_229 v_mult_~n_BEFORE_CALL_228 |c_mult_#res|) 2147483647))) is different from false [2021-11-12 23:29:45,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_228 Int) (|v_mult_#in~n_BEFORE_CALL_163| Int) (v_mult_~n_BEFORE_CALL_229 Int)) (or (< v_mult_~n_BEFORE_CALL_229 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_229 v_mult_~n_BEFORE_CALL_228 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_228 |v_mult_#in~n_BEFORE_CALL_163|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_228_106 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (|v_mult_#in~n_4118| Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_228_106) (< aux_mod_v_mult_~n_BEFORE_CALL_228_106 2) (<= |v_mult_#in~n_4118| v_mult_~n_BEFORE_CALL_229) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 |v_mult_#in~n_4118|) (<= (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 |v_mult_#in~n_BEFORE_CALL_163| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|)) 2147483647) (forall ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (or (< |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (<= (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (div (+ (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 4) v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2) (* |v_mult_#in~n_4118| 5)) 2)) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) |v_mult_#in~n_3982| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|))))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2))) (exists ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* v_mult_~n_BEFORE_CALL_228 (- 1))) 2) (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|)) (<= |v_mult_#in~n_3982| v_mult_~n_BEFORE_CALL_228) (<= |v_mult_#in~n_3980| |v_mult_#in~n_3982|))))) is different from false [2021-11-12 23:29:47,408 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_228 Int) (|v_mult_#in~n_BEFORE_CALL_163| Int) (v_mult_~n_BEFORE_CALL_229 Int)) (or (< v_mult_~n_BEFORE_CALL_229 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_229 v_mult_~n_BEFORE_CALL_228 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_228 |v_mult_#in~n_BEFORE_CALL_163|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_228_106 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (|v_mult_#in~n_4118| Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_228_106) (< aux_mod_v_mult_~n_BEFORE_CALL_228_106 2) (<= |v_mult_#in~n_4118| v_mult_~n_BEFORE_CALL_229) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 |v_mult_#in~n_4118|) (<= (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 |v_mult_#in~n_BEFORE_CALL_163| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|)) 2147483647) (forall ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (or (< |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (<= (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (div (+ (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 4) v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2) (* |v_mult_#in~n_4118| 5)) 2)) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) |v_mult_#in~n_3982| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|))))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2))) (exists ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* v_mult_~n_BEFORE_CALL_228 (- 1))) 2) (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|)) (<= |v_mult_#in~n_3982| v_mult_~n_BEFORE_CALL_228) (<= |v_mult_#in~n_3980| |v_mult_#in~n_3982|))))) is different from true [2021-11-12 23:30:01,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_228_142 Int) (aux_div_v_mult_~n_BEFORE_CALL_228_142 Int) (|v_mult_#in~n_BEFORE_CALL_163| Int) (v_mult_~n_BEFORE_CALL_229 Int) (|v_mult_#in~n_4228| Int)) (or (< aux_mod_v_mult_~n_BEFORE_CALL_228_142 0) (< v_mult_~n_BEFORE_CALL_229 |c_mult_#in~n|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_228_106 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 Int) (|v_mult_#in~n_4118| Int)) (and (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_228_106) (< aux_mod_v_mult_~n_BEFORE_CALL_228_106 2) (<= |v_mult_#in~n_4118| v_mult_~n_BEFORE_CALL_229) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 |v_mult_#in~n_4118|) (<= (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 |v_mult_#in~n_BEFORE_CALL_163| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|)) 2147483647) (forall ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (or (< |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (<= (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|) (div (+ (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 4) v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2) (* |v_mult_#in~n_4118| 5)) 2)) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_106 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) |v_mult_#in~n_3982| (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45) (* 5 |v_mult_#in~n_4118|))))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_228_106_45 2))) (exists ((|v_mult_#in~n_3982| Int) (|v_mult_#in~n_3980| Int)) (and (< (div (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_142 (* |v_mult_#in~n_3980| (- 3)) (* |v_mult_#in~n_3982| (- 3)) (* |v_mult_#in~n_4228| 2) (* aux_div_v_mult_~n_BEFORE_CALL_228_142 3) c_mult_~n) 2) (+ |v_mult_#in~n_3982| |v_mult_#in~n_3980|)) (<= (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_142 (* 3 aux_div_v_mult_~n_BEFORE_CALL_228_142) (* 2 |v_mult_#in~n_4228|) c_mult_~n |v_mult_#in~n_3982|) 2147483647) (<= |v_mult_#in~n_3980| |v_mult_#in~n_3982|))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_229 aux_mod_v_mult_~n_BEFORE_CALL_228_142 |v_mult_#in~n_BEFORE_CALL_163| (* 3 aux_div_v_mult_~n_BEFORE_CALL_228_142) (* 2 |v_mult_#in~n_4228|) c_mult_~n)) (< c_mult_~n |v_mult_#in~n_4228|) (<= (* 2 c_mult_~n) aux_div_v_mult_~n_BEFORE_CALL_228_142) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_228_142))) is different from false [2021-11-12 23:30:02,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_163|, v_mult_~n_BEFORE_CALL_229] [2021-11-12 23:30:02,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664515288] [2021-11-12 23:30:02,081 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:30:02,081 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:30:02,082 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:610) 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-12 23:30:02,083 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:30:02,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2021-11-12 23:30:02,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464507491] [2021-11-12 23:30:02,083 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:30:02,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-12 23:30:02,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:30:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-12 23:30:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2356, Unknown=19, NotChecked=300, Total=2862 [2021-11-12 23:30:02,085 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 5 states have call successors, (6), 2 states have call predecessors, (6), 13 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-12 23:30:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:30:10,476 INFO L93 Difference]: Finished difference Result 307 states and 333 transitions. [2021-11-12 23:30:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-12 23:30:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 5 states have call successors, (6), 2 states have call predecessors, (6), 13 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 157 [2021-11-12 23:30:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:30:10,478 INFO L225 Difference]: With dead ends: 307 [2021-11-12 23:30:10,478 INFO L226 Difference]: Without dead ends: 304 [2021-11-12 23:30:10,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 156 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=754, Invalid=8549, Unknown=21, NotChecked=576, Total=9900 [2021-11-12 23:30:10,480 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 170 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1839.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 3069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.30ms SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2052.22ms IncrementalHoareTripleChecker+Time [2021-11-12 23:30:10,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 666 Invalid, 3069 Unknown, 0 Unchecked, 8.30ms Time], IncrementalHoareTripleChecker [126 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 2052.22ms Time] [2021-11-12 23:30:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-12 23:30:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 236. [2021-11-12 23:30:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 188 states have (on average 1.0372340425531914) internal successors, (195), 187 states have internal predecessors, (195), 9 states have call successors, (9), 6 states have call predecessors, (9), 38 states have return successors, (55), 42 states have call predecessors, (55), 7 states have call successors, (55) [2021-11-12 23:30:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 259 transitions. [2021-11-12 23:30:10,494 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 259 transitions. Word has length 157 [2021-11-12 23:30:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:30:10,495 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 259 transitions. [2021-11-12 23:30:10,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 5 states have call successors, (6), 2 states have call predecessors, (6), 13 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-12 23:30:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 259 transitions. [2021-11-12 23:30:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-12 23:30:10,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:30:10,497 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 11, 11, 11, 11, 11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:30:10,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-12 23:30:10,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:30:10,723 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:30:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:30:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -941121075, now seen corresponding path program 12 times [2021-11-12 23:30:10,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:30:10,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000112409] [2021-11-12 23:30:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:30:10,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:30:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:30:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 217 proven. 239 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2021-11-12 23:30:11,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:30:11,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000112409] [2021-11-12 23:30:11,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000112409] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:30:11,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964114100] [2021-11-12 23:30:11,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:30:11,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:30:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:30:11,335 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:30:11,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-12 23:30:11,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:30:11,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:30:11,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-12 23:30:11,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:30:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 3 proven. 468 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-11-12 23:30:13,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:30:18,008 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_240] [2021-11-12 23:30:18,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2015284388] [2021-11-12 23:30:18,010 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:30:18,010 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:30:18,010 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:610) 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-12 23:30:18,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:30:18,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-12 23:30:18,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789254088] [2021-11-12 23:30:18,011 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:30:18,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-12 23:30:18,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:30:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-12 23:30:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2021-11-12 23:30:18,012 INFO L87 Difference]: Start difference. First operand 236 states and 259 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-12 23:30:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:30:20,341 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2021-11-12 23:30:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-12 23:30:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) Word has length 134 [2021-11-12 23:30:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:30:20,343 INFO L225 Difference]: With dead ends: 281 [2021-11-12 23:30:20,343 INFO L226 Difference]: Without dead ends: 278 [2021-11-12 23:30:20,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=497, Invalid=5983, Unknown=0, NotChecked=0, Total=6480 [2021-11-12 23:30:20,344 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 111 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 969.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.82ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1082.84ms IncrementalHoareTripleChecker+Time [2021-11-12 23:30:20,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 630 Invalid, 1727 Unknown, 0 Unchecked, 4.82ms Time], IncrementalHoareTripleChecker [65 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1082.84ms Time] [2021-11-12 23:30:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-12 23:30:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 241. [2021-11-12 23:30:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 1.0364583333333333) internal successors, (199), 191 states have internal predecessors, (199), 9 states have call successors, (9), 6 states have call predecessors, (9), 39 states have return successors, (56), 43 states have call predecessors, (56), 7 states have call successors, (56) [2021-11-12 23:30:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2021-11-12 23:30:20,356 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 134 [2021-11-12 23:30:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:30:20,356 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2021-11-12 23:30:20,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-12 23:30:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2021-11-12 23:30:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-12 23:30:20,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:30:20,359 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2021-11-12 23:30:20,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-12 23:30:20,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:30:20,573 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:30:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:30:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1258470644, now seen corresponding path program 10 times [2021-11-12 23:30:20,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:30:20,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374947646] [2021-11-12 23:30:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:30:20,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:30:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:30:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 626 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2021-11-12 23:30:21,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:30:21,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374947646] [2021-11-12 23:30:21,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374947646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:30:21,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228248346] [2021-11-12 23:30:21,670 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:30:21,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:30:21,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:30:21,671 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:30:21,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-12 23:30:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:30:22,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-12 23:30:22,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:30:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 626 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2021-11-12 23:30:24,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:31:35,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_257 Int) (v_mult_~n_BEFORE_CALL_258 Int) (|v_mult_#in~n_BEFORE_CALL_188| Int)) (or (< v_mult_~n_BEFORE_CALL_257 |v_mult_#in~n_BEFORE_CALL_188|) (exists ((|v_mult_#in~n_5005| Int) (|v_mult_#in~n_5006| Int) (aux_div_v_mult_~n_BEFORE_CALL_257_106 Int) (aux_mod_v_mult_~n_BEFORE_CALL_257_106 Int)) (and (<= |v_mult_#in~n_5005| |v_mult_#in~n_5006|) (< aux_div_v_mult_~n_BEFORE_CALL_257_106 (+ (* 2 |v_mult_#in~n_5005|) (* 2 v_mult_~n_BEFORE_CALL_258))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (<= (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 |v_mult_#in~n_BEFORE_CALL_188| (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106)) 2147483647) (forall ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (or (< |v_mult_#in~n_4739| |v_mult_#in~n_4738|) (<= (+ 8589934588 (* 2 |v_mult_#in~n_4738|)) (+ (* 4 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (* 20 |v_mult_#in~n_5006|) (* 4 v_mult_~n_BEFORE_CALL_258) (* 8 aux_div_v_mult_~n_BEFORE_CALL_257_106))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106) |v_mult_#in~n_4739|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_257_106 2) (<= |v_mult_#in~n_5006| v_mult_~n_BEFORE_CALL_258))) (< v_mult_~n_BEFORE_CALL_258 |c_mult_#in~n|) (exists ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (+ (* 2 |v_mult_#in~n_4738|) (* 4 v_mult_~n_BEFORE_CALL_257))) (<= |v_mult_#in~n_4739| v_mult_~n_BEFORE_CALL_257) (<= |v_mult_#in~n_4738| |v_mult_#in~n_4739|))) (<= (+ v_mult_~n_BEFORE_CALL_258 v_mult_~n_BEFORE_CALL_257 |c_mult_#res|) 2147483647))) is different from false [2021-11-12 23:31:42,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_257 Int) (v_mult_~n_BEFORE_CALL_258 Int) (|v_mult_#in~n_BEFORE_CALL_188| Int)) (or (< v_mult_~n_BEFORE_CALL_257 |v_mult_#in~n_BEFORE_CALL_188|) (exists ((|v_mult_#in~n_5005| Int) (|v_mult_#in~n_5006| Int) (aux_div_v_mult_~n_BEFORE_CALL_257_106 Int) (aux_mod_v_mult_~n_BEFORE_CALL_257_106 Int)) (and (<= |v_mult_#in~n_5005| |v_mult_#in~n_5006|) (< aux_div_v_mult_~n_BEFORE_CALL_257_106 (+ (* 2 |v_mult_#in~n_5005|) (* 2 v_mult_~n_BEFORE_CALL_258))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (<= (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 |v_mult_#in~n_BEFORE_CALL_188| (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106)) 2147483647) (forall ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (or (< |v_mult_#in~n_4739| |v_mult_#in~n_4738|) (<= (+ 8589934588 (* 2 |v_mult_#in~n_4738|)) (+ (* 4 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (* 20 |v_mult_#in~n_5006|) (* 4 v_mult_~n_BEFORE_CALL_258) (* 8 aux_div_v_mult_~n_BEFORE_CALL_257_106))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106) |v_mult_#in~n_4739|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_257_106 2) (<= |v_mult_#in~n_5006| v_mult_~n_BEFORE_CALL_258))) (< v_mult_~n_BEFORE_CALL_258 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_258 v_mult_~n_BEFORE_CALL_257 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (+ (* 2 |v_mult_#in~n_4738|) (* 4 v_mult_~n_BEFORE_CALL_257))) (<= |v_mult_#in~n_4739| v_mult_~n_BEFORE_CALL_257) (<= |v_mult_#in~n_4738| |v_mult_#in~n_4739|))))) is different from false [2021-11-12 23:31:44,331 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_257 Int) (v_mult_~n_BEFORE_CALL_258 Int) (|v_mult_#in~n_BEFORE_CALL_188| Int)) (or (< v_mult_~n_BEFORE_CALL_257 |v_mult_#in~n_BEFORE_CALL_188|) (exists ((|v_mult_#in~n_5005| Int) (|v_mult_#in~n_5006| Int) (aux_div_v_mult_~n_BEFORE_CALL_257_106 Int) (aux_mod_v_mult_~n_BEFORE_CALL_257_106 Int)) (and (<= |v_mult_#in~n_5005| |v_mult_#in~n_5006|) (< aux_div_v_mult_~n_BEFORE_CALL_257_106 (+ (* 2 |v_mult_#in~n_5005|) (* 2 v_mult_~n_BEFORE_CALL_258))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (<= (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 |v_mult_#in~n_BEFORE_CALL_188| (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106)) 2147483647) (forall ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (or (< |v_mult_#in~n_4739| |v_mult_#in~n_4738|) (<= (+ 8589934588 (* 2 |v_mult_#in~n_4738|)) (+ (* 4 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (* 20 |v_mult_#in~n_5006|) (* 4 v_mult_~n_BEFORE_CALL_258) (* 8 aux_div_v_mult_~n_BEFORE_CALL_257_106))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_258 aux_mod_v_mult_~n_BEFORE_CALL_257_106 (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106) |v_mult_#in~n_4739|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_257_106 2) (<= |v_mult_#in~n_5006| v_mult_~n_BEFORE_CALL_258))) (< v_mult_~n_BEFORE_CALL_258 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_258 v_mult_~n_BEFORE_CALL_257 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (+ (* 2 |v_mult_#in~n_4738|) (* 4 v_mult_~n_BEFORE_CALL_257))) (<= |v_mult_#in~n_4739| v_mult_~n_BEFORE_CALL_257) (<= |v_mult_#in~n_4738| |v_mult_#in~n_4739|))))) is different from true [2021-11-12 23:32:02,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_257 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67 Int) (|v_mult_#in~n_BEFORE_CALL_188| Int) (aux_mod_v_mult_~n_BEFORE_CALL_258_112 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67 Int)) (or (< v_mult_~n_BEFORE_CALL_257 |v_mult_#in~n_BEFORE_CALL_188|) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (< aux_mod_v_mult_~n_BEFORE_CALL_258_112 0) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_258_112) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67 0) (<= c_mult_~n aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (exists ((|v_mult_#in~n_5005| Int) (|v_mult_#in~n_5006| Int) (aux_div_v_mult_~n_BEFORE_CALL_257_106 Int) (aux_mod_v_mult_~n_BEFORE_CALL_257_106 Int)) (let ((.cse0 (* 7 c_mult_~n)) (.cse1 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67)) (.cse2 (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67))) (and (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_257_106 |v_mult_#in~n_BEFORE_CALL_188| (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106)) (+ v_mult_~n_BEFORE_CALL_257 .cse0 aux_mod_v_mult_~n_BEFORE_CALL_258_112 .cse1 .cse2)) (<= |v_mult_#in~n_5005| |v_mult_#in~n_5006|) (forall ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (or (< (+ v_mult_~n_BEFORE_CALL_257 (* 7 c_mult_~n) aux_mod_v_mult_~n_BEFORE_CALL_258_112 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67)) (+ aux_mod_v_mult_~n_BEFORE_CALL_257_106 (* 5 |v_mult_#in~n_5006|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_257_106) |v_mult_#in~n_4739|)) (< |v_mult_#in~n_4739| |v_mult_#in~n_4738|) (<= (+ (* 28 c_mult_~n) (* 2 |v_mult_#in~n_4738|) (* 4 v_mult_~n_BEFORE_CALL_257) (* 24 aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (* 4 aux_mod_v_mult_~n_BEFORE_CALL_258_112) (* 12 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67)) (+ (* 4 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (* 20 |v_mult_#in~n_5006|) (* 8 aux_div_v_mult_~n_BEFORE_CALL_257_106))))) (< (+ aux_div_v_mult_~n_BEFORE_CALL_257_106 (* 14 c_mult_~n) (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (* 2 v_mult_~n_BEFORE_CALL_257) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_258_112)) (+ 4294967294 (* 2 |v_mult_#in~n_5005|))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_257_106) (<= (+ v_mult_~n_BEFORE_CALL_257 .cse0 aux_mod_v_mult_~n_BEFORE_CALL_258_112 .cse1 .cse2 |v_mult_#in~n_5006|) 2147483647) (< aux_mod_v_mult_~n_BEFORE_CALL_257_106 2)))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_257 (* 7 c_mult_~n) aux_mod_v_mult_~n_BEFORE_CALL_258_112 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_258_112_67) |c_mult_#in~n|)) (exists ((|v_mult_#in~n_4739| Int) (|v_mult_#in~n_4738| Int)) (and (< (div (+ 2147483647 (* |v_mult_#in~n_4739| (- 3))) 2) (+ (* 2 |v_mult_#in~n_4738|) (* 4 v_mult_~n_BEFORE_CALL_257))) (<= |v_mult_#in~n_4739| v_mult_~n_BEFORE_CALL_257) (<= |v_mult_#in~n_4738| |v_mult_#in~n_4739|))))) is different from false [2021-11-12 23:32:02,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_257, |v_mult_#in~n_BEFORE_CALL_188|] [2021-11-12 23:32:02,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121462841] [2021-11-12 23:32:02,126 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-12 23:32:02,126 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:32:02,127 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:610) 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-12 23:32:02,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:32:02,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2021-11-12 23:32:02,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702779579] [2021-11-12 23:32:02,127 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:32:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-12 23:32:02,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:32:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-12 23:32:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2967, Unknown=19, NotChecked=336, Total=3540 [2021-11-12 23:32:02,129 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-12 23:32:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:32:17,439 INFO L93 Difference]: Finished difference Result 376 states and 413 transitions. [2021-11-12 23:32:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-12 23:32:17,440 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2021-11-12 23:32:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:32:17,442 INFO L225 Difference]: With dead ends: 376 [2021-11-12 23:32:17,442 INFO L226 Difference]: Without dead ends: 375 [2021-11-12 23:32:17,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 163 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=834, Invalid=13434, Unknown=24, NotChecked=714, Total=15006 [2021-11-12 23:32:17,445 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 231 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2097.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.50ms SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2326.62ms IncrementalHoareTripleChecker+Time [2021-11-12 23:32:17,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 760 Invalid, 3289 Unknown, 0 Unchecked, 9.50ms Time], IncrementalHoareTripleChecker [132 Valid, 3157 Invalid, 0 Unknown, 0 Unchecked, 2326.62ms Time] [2021-11-12 23:32:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-12 23:32:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 246. [2021-11-12 23:32:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 196 states have (on average 1.0357142857142858) internal successors, (203), 195 states have internal predecessors, (203), 9 states have call successors, (9), 6 states have call predecessors, (9), 40 states have return successors, (58), 44 states have call predecessors, (58), 7 states have call successors, (58) [2021-11-12 23:32:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 270 transitions. [2021-11-12 23:32:17,460 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 270 transitions. Word has length 171 [2021-11-12 23:32:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:32:17,461 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 270 transitions. [2021-11-12 23:32:17,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-12 23:32:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 270 transitions. [2021-11-12 23:32:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-12 23:32:17,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:32:17,464 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 15, 15, 15, 15, 14, 13, 13, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:32:17,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-12 23:32:17,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:32:17,679 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:32:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:32:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash 826403667, now seen corresponding path program 13 times [2021-11-12 23:32:17,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:32:17,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131466284] [2021-11-12 23:32:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:32:17,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:32:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:32:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 6 proven. 735 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-12 23:32:18,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:32:18,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131466284] [2021-11-12 23:32:18,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131466284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:32:18,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052888599] [2021-11-12 23:32:18,574 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:32:18,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:32:18,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:32:18,600 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:32:18,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-12 23:32:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:32:19,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-12 23:32:19,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:32:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 6 proven. 735 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-12 23:32:21,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:32:51,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_275 Int) (v_mult_~n_BEFORE_CALL_276 Int)) (or (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_275) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|) (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_275))))) (< v_mult_~n_BEFORE_CALL_276 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_276 v_mult_~n_BEFORE_CALL_275 |c_mult_#t~ret8| c_mult_~n) 1968526677) (and (<= v_mult_~n_BEFORE_CALL_275 178956970) (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_276))) (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_276) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|)))))) is different from false [2021-11-12 23:33:24,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_277 Int) (v_mult_~n_BEFORE_CALL_275 Int) (v_mult_~n_BEFORE_CALL_276 Int)) (or (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_275) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|) (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_275))))) (and (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_277) (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 6 v_mult_~n_BEFORE_CALL_277) (* 2 |v_mult_#in~n_5613|))) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|))) (<= v_mult_~n_BEFORE_CALL_276 178956970)) (< v_mult_~n_BEFORE_CALL_277 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_277 v_mult_~n_BEFORE_CALL_276 v_mult_~n_BEFORE_CALL_275 |c_mult_#res|) 1968526677) (and (<= v_mult_~n_BEFORE_CALL_275 178956970) (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_276))) (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_276) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|)))))) is different from false [2021-11-12 23:33:29,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_277 Int) (v_mult_~n_BEFORE_CALL_275 Int) (v_mult_~n_BEFORE_CALL_276 Int)) (or (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_275) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|) (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_275))))) (and (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_277) (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 6 v_mult_~n_BEFORE_CALL_277) (* 2 |v_mult_#in~n_5613|))) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|))) (<= v_mult_~n_BEFORE_CALL_276 178956970)) (< v_mult_~n_BEFORE_CALL_277 |c_mult_#in~n|) (and (<= v_mult_~n_BEFORE_CALL_275 178956970) (exists ((|v_mult_#in~n_5613| Int) (|v_mult_#in~n_5615| Int)) (and (< 1968526677 (+ (* 3 |v_mult_#in~n_5615|) (* 2 |v_mult_#in~n_5613|) (* 6 v_mult_~n_BEFORE_CALL_276))) (<= |v_mult_#in~n_5613| v_mult_~n_BEFORE_CALL_276) (<= |v_mult_#in~n_5615| |v_mult_#in~n_5613|)))) (<= (+ v_mult_~n_BEFORE_CALL_277 v_mult_~n_BEFORE_CALL_276 v_mult_~n_BEFORE_CALL_275 |c_mult_#t~ret8| c_mult_~n) 1968526677))) is different from false [2021-11-12 23:34:03,794 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_277, v_mult_~n_BEFORE_CALL_275, v_mult_~n_BEFORE_CALL_276] [2021-11-12 23:34:03,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1408418551] [2021-11-12 23:34:03,795 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-12 23:34:03,796 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:34:03,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:610) 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-12 23:34:03,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:34:03,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2021-11-12 23:34:03,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363306757] [2021-11-12 23:34:03,797 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:34:03,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-12 23:34:03,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:34:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-12 23:34:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2706, Unknown=13, NotChecked=324, Total=3306 [2021-11-12 23:34:03,799 INFO L87 Difference]: Start difference. First operand 246 states and 270 transitions. Second operand has 33 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 5 states have call successors, (6), 2 states have call predecessors, (6), 14 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-12 23:34:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:34:08,730 INFO L93 Difference]: Finished difference Result 327 states and 354 transitions. [2021-11-12 23:34:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-12 23:34:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 5 states have call successors, (6), 2 states have call predecessors, (6), 14 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) Word has length 168 [2021-11-12 23:34:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:34:08,733 INFO L225 Difference]: With dead ends: 327 [2021-11-12 23:34:08,733 INFO L226 Difference]: Without dead ends: 324 [2021-11-12 23:34:08,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 175 SyntacticMatches, 12 SemanticMatches, 106 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2272 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=947, Invalid=9972, Unknown=13, NotChecked=624, Total=11556 [2021-11-12 23:34:08,735 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 183 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2258.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.29ms SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2508.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:34:08,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 772 Invalid, 3558 Unknown, 0 Unchecked, 10.29ms Time], IncrementalHoareTripleChecker [137 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 2508.29ms Time] [2021-11-12 23:34:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-12 23:34:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 251. [2021-11-12 23:34:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 200 states have (on average 1.035) internal successors, (207), 199 states have internal predecessors, (207), 9 states have call successors, (9), 6 states have call predecessors, (9), 41 states have return successors, (59), 45 states have call predecessors, (59), 7 states have call successors, (59) [2021-11-12 23:34:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 275 transitions. [2021-11-12 23:34:08,749 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 275 transitions. Word has length 168 [2021-11-12 23:34:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:34:08,749 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 275 transitions. [2021-11-12 23:34:08,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 5 states have call successors, (6), 2 states have call predecessors, (6), 14 states have return successors, (14), 14 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-12 23:34:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 275 transitions. [2021-11-12 23:34:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-12 23:34:08,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:34:08,752 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 14, 14, 14, 14, 13, 12, 12, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:34:08,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-12 23:34:08,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-12 23:34:08,975 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-12 23:34:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:34:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -317290019, now seen corresponding path program 14 times [2021-11-12 23:34:08,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:34:08,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386800479] [2021-11-12 23:34:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:34:08,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:34:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:34:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 271 proven. 405 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-11-12 23:34:09,683 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:34:09,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386800479] [2021-11-12 23:34:09,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386800479] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:34:09,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181316051] [2021-11-12 23:34:09,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:34:09,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:34:09,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:34:09,685 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:34:09,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_622af757-118b-43ef-a31f-5fccd63d5708/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-12 23:34:10,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-12 23:34:10,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:34:10,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-12 23:34:10,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:34:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 9 proven. 682 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-12 23:34:12,449 INFO L328 TraceCheckSpWp]: Computing backward predicates...