./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Addition02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Addition02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:25:57,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:25:57,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:25:57,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:25:57,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:25:57,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:25:57,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:25:57,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:25:57,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:25:57,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:25:57,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:25:57,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:25:57,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:25:57,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:25:57,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:25:57,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:25:57,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:25:57,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:25:57,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:25:57,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:25:57,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:25:57,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:25:57,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:25:57,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:25:57,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:25:57,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:25:57,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:25:57,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:25:57,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:25:57,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:25:57,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:25:57,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:25:57,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:25:57,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:25:57,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:25:57,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:25:57,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:25:57,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:25:57,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:25:57,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:25:57,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:25:57,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-03 04:25:57,282 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:25:57,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:25:57,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:25:57,284 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:25:57,284 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:25:57,284 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:25:57,285 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:25:57,285 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:25:57,291 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:25:57,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:25:57,293 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:25:57,293 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:25:57,293 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:25:57,293 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:25:57,294 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:25:57,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:25:57,295 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:25:57,295 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 04:25:57,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:25:57,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:25:57,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:25:57,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:25:57,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:25:57,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:25:57,296 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-03 04:25:57,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:25:57,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:25:57,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:25:57,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:25:57,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:25:57,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:25:57,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:25:57,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:25:57,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:25:57,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:25:57,300 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:25:57,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:25:57,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:25:57,301 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:25:57,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:25:57,302 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_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 [2021-11-03 04:25:57,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:25:57,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:25:57,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:25:57,579 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:25:57,580 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:25:57,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/recursive/Addition02.c [2021-11-03 04:25:57,651 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/data/2af91a867/c750d470f9844233aa1e08118c965931/FLAG1d76c7054 [2021-11-03 04:25:58,200 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:25:58,200 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/sv-benchmarks/c/recursive/Addition02.c [2021-11-03 04:25:58,207 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/data/2af91a867/c750d470f9844233aa1e08118c965931/FLAG1d76c7054 [2021-11-03 04:25:58,568 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/data/2af91a867/c750d470f9844233aa1e08118c965931 [2021-11-03 04:25:58,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:25:58,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:25:58,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:25:58,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:25:58,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:25:58,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402bc1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58, skipping insertion in model container [2021-11-03 04:25:58,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:25:58,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:25:58,837 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_151d2431-a73c-41db-9737-8e9706152700/sv-benchmarks/c/recursive/Addition02.c[1124,1137] [2021-11-03 04:25:58,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:25:58,856 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:25:58,885 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_151d2431-a73c-41db-9737-8e9706152700/sv-benchmarks/c/recursive/Addition02.c[1124,1137] [2021-11-03 04:25:58,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:25:58,902 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:25:58,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58 WrapperNode [2021-11-03 04:25:58,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:25:58,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:25:58,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:25:58,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:25:58,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:25:58,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:25:58,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:25:58,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:25:58,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:25:58,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:25:58,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:25:58,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:25:58,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (1/1) ... [2021-11-03 04:25:58,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:25:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:25:59,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:25:59,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:25:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:25:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2021-11-03 04:25:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2021-11-03 04:25:59,447 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:25:59,447 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:25:59,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:25:59 BoogieIcfgContainer [2021-11-03 04:25:59,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:25:59,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:25:59,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:25:59,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:25:59,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:25:58" (1/3) ... [2021-11-03 04:25:59,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae5199c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:25:59, skipping insertion in model container [2021-11-03 04:25:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:25:58" (2/3) ... [2021-11-03 04:25:59,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae5199c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:25:59, skipping insertion in model container [2021-11-03 04:25:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:25:59" (3/3) ... [2021-11-03 04:25:59,462 INFO L111 eAbstractionObserver]: Analyzing ICFG Addition02.c [2021-11-03 04:25:59,469 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:25:59,469 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-11-03 04:25:59,530 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:25:59,540 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:25:59,540 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-03 04:25:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 04:25:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 04:25:59,563 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:25:59,564 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:25:59,564 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:25:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:25:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2044595686, now seen corresponding path program 1 times [2021-11-03 04:25:59,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:25:59,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325562391] [2021-11-03 04:25:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:25:59,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:25:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:25:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:25:59,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:25:59,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325562391] [2021-11-03 04:25:59,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325562391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:25:59,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:25:59,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:25:59,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570160137] [2021-11-03 04:25:59,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:25:59,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:25:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:25:59,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:25:59,887 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) 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-03 04:26:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,001 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-11-03 04:26:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:26:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-03 04:26:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,011 INFO L225 Difference]: With dead ends: 65 [2021-11-03 04:26:00,012 INFO L226 Difference]: Without dead ends: 59 [2021-11-03 04:26:00,015 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:26:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-03 04:26:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2021-11-03 04:26:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 45 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 04:26:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2021-11-03 04:26:00,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 8 [2021-11-03 04:26:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,061 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2021-11-03 04:26:00,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-03 04:26:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2021-11-03 04:26:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 04:26:00,063 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,063 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:26:00,064 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1042043244, now seen corresponding path program 1 times [2021-11-03 04:26:00,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136265479] [2021-11-03 04:26:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,153 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136265479] [2021-11-03 04:26:00,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136265479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:26:00,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898193831] [2021-11-03 04:26:00,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:26:00,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:26:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:00,158 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-03 04:26:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,238 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2021-11-03 04:26:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:26:00,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2021-11-03 04:26:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,241 INFO L225 Difference]: With dead ends: 97 [2021-11-03 04:26:00,241 INFO L226 Difference]: Without dead ends: 95 [2021-11-03 04:26:00,242 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:26:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-03 04:26:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-11-03 04:26:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:26:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2021-11-03 04:26:00,257 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 9 [2021-11-03 04:26:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,257 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2021-11-03 04:26:00,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-03 04:26:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2021-11-03 04:26:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:26:00,258 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,259 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:26:00,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2056522533, now seen corresponding path program 1 times [2021-11-03 04:26:00,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651749729] [2021-11-03 04:26:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651749729] [2021-11-03 04:26:00,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651749729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:26:00,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275007363] [2021-11-03 04:26:00,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:26:00,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:26:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:26:00,329 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:26:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,367 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2021-11-03 04:26:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:26:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-03 04:26:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,376 INFO L225 Difference]: With dead ends: 89 [2021-11-03 04:26:00,376 INFO L226 Difference]: Without dead ends: 88 [2021-11-03 04:26:00,377 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-03 04:26:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-03 04:26:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 74 states have internal predecessors, (102), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:26:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2021-11-03 04:26:00,413 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 10 [2021-11-03 04:26:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,413 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2021-11-03 04:26:00,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:26:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2021-11-03 04:26:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:26:00,414 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,429 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:26:00,430 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2056397732, now seen corresponding path program 1 times [2021-11-03 04:26:00,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858937178] [2021-11-03 04:26:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858937178] [2021-11-03 04:26:00,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858937178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:26:00,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805165818] [2021-11-03 04:26:00,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:26:00,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:26:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:00,530 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-03 04:26:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,627 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2021-11-03 04:26:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:26:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2021-11-03 04:26:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,631 INFO L225 Difference]: With dead ends: 97 [2021-11-03 04:26:00,633 INFO L226 Difference]: Without dead ends: 95 [2021-11-03 04:26:00,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:26:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-03 04:26:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2021-11-03 04:26:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 73 states have internal predecessors, (96), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:26:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-11-03 04:26:00,652 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 10 [2021-11-03 04:26:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,653 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-11-03 04:26:00,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-03 04:26:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2021-11-03 04:26:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:26:00,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,654 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:26:00,655 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 672310965, now seen corresponding path program 1 times [2021-11-03 04:26:00,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553144565] [2021-11-03 04:26:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553144565] [2021-11-03 04:26:00,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553144565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:26:00,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538191546] [2021-11-03 04:26:00,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:26:00,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:26:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:26:00,693 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:26:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,713 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2021-11-03 04:26:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:26:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-03 04:26:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,714 INFO L225 Difference]: With dead ends: 87 [2021-11-03 04:26:00,715 INFO L226 Difference]: Without dead ends: 67 [2021-11-03 04:26:00,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-03 04:26:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-11-03 04:26:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-03 04:26:00,725 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 11 [2021-11-03 04:26:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,725 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-03 04:26:00,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 04:26:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-03 04:26:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:26:00,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:26:00,727 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 676179822, now seen corresponding path program 1 times [2021-11-03 04:26:00,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454242091] [2021-11-03 04:26:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454242091] [2021-11-03 04:26:00,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454242091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:26:00,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447425643] [2021-11-03 04:26:00,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:26:00,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:26:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:26:00,789 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-03 04:26:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,815 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2021-11-03 04:26:00,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:26:00,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 11 [2021-11-03 04:26:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,816 INFO L225 Difference]: With dead ends: 53 [2021-11-03 04:26:00,816 INFO L226 Difference]: Without dead ends: 52 [2021-11-03 04:26:00,817 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:26:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-03 04:26:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-03 04:26:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 47 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-11-03 04:26:00,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 11 [2021-11-03 04:26:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,823 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-11-03 04:26:00,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-03 04:26:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-11-03 04:26:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:26:00,824 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,824 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:26:00,824 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -186889601, now seen corresponding path program 1 times [2021-11-03 04:26:00,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386458593] [2021-11-03 04:26:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:00,906 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:00,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386458593] [2021-11-03 04:26:00,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386458593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:00,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:00,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:26:00,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813079468] [2021-11-03 04:26:00,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:26:00,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:00,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:26:00,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:00,908 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-03 04:26:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:00,958 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-11-03 04:26:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:26:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2021-11-03 04:26:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:00,959 INFO L225 Difference]: With dead ends: 76 [2021-11-03 04:26:00,959 INFO L226 Difference]: Without dead ends: 43 [2021-11-03 04:26:00,961 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:26:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-11-03 04:26:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-11-03 04:26:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-11-03 04:26:00,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2021-11-03 04:26:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:00,980 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-03 04:26:00,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-03 04:26:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2021-11-03 04:26:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 04:26:00,985 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:00,985 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:00,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:26:00,986 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1626555607, now seen corresponding path program 1 times [2021-11-03 04:26:00,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:00,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949215835] [2021-11-03 04:26:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:00,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:01,090 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:01,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949215835] [2021-11-03 04:26:01,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949215835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:01,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995759729] [2021-11-03 04:26:01,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:01,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:01,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:01,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 04:26:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:01,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 04:26:01,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:01,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:26:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:01,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995759729] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:26:01,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261366204] [2021-11-03 04:26:01,405 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:26:01,405 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:26:01,411 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:26:01,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:26:01,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-03 04:26:01,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322431177] [2021-11-03 04:26:01,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 04:26:01,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 04:26:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:26:01,417 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:01,595 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2021-11-03 04:26:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 04:26:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-03 04:26:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:01,597 INFO L225 Difference]: With dead ends: 150 [2021-11-03 04:26:01,597 INFO L226 Difference]: Without dead ends: 148 [2021-11-03 04:26:01,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-03 04:26:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-03 04:26:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2021-11-03 04:26:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 98 states have internal predecessors, (118), 12 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2021-11-03 04:26:01,647 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 16 [2021-11-03 04:26:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:01,649 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2021-11-03 04:26:01,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2021-11-03 04:26:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-03 04:26:01,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:01,650 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:26:01,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 04:26:01,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:01,883 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1927547204, now seen corresponding path program 1 times [2021-11-03 04:26:01,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:01,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002205609] [2021-11-03 04:26:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:01,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:01,921 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-03 04:26:01,922 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:01,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002205609] [2021-11-03 04:26:01,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002205609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:26:01,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:26:01,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:26:01,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690624052] [2021-11-03 04:26:01,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:26:01,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:26:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:26:01,925 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:01,954 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-11-03 04:26:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:26:01,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2021-11-03 04:26:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:01,956 INFO L225 Difference]: With dead ends: 110 [2021-11-03 04:26:01,956 INFO L226 Difference]: Without dead ends: 41 [2021-11-03 04:26:01,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:26:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-03 04:26:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-11-03 04:26:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2021-11-03 04:26:01,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 20 [2021-11-03 04:26:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:01,961 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2021-11-03 04:26:01,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2021-11-03 04:26:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 04:26:01,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:01,963 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2021-11-03 04:26:01,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:26:01,964 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 340979470, now seen corresponding path program 2 times [2021-11-03 04:26:01,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:01,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90046783] [2021-11-03 04:26:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:01,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:02,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:02,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90046783] [2021-11-03 04:26:02,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90046783] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:02,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751595831] [2021-11-03 04:26:02,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:26:02,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:02,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:02,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 04:26:02,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-03 04:26:02,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:26:02,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-03 04:26:02,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:02,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:26:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:02,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751595831] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:26:02,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048029723] [2021-11-03 04:26:02,607 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:26:02,607 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:26:02,608 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:26:02,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:26:02,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2021-11-03 04:26:02,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845254930] [2021-11-03 04:26:02,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-03 04:26:02,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:02,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-03 04:26:02,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-11-03 04:26:02,612 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:02,837 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-11-03 04:26:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-03 04:26:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-03 04:26:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:02,839 INFO L225 Difference]: With dead ends: 94 [2021-11-03 04:26:02,839 INFO L226 Difference]: Without dead ends: 93 [2021-11-03 04:26:02,840 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2021-11-03 04:26:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-03 04:26:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-11-03 04:26:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2021-11-03 04:26:02,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2021-11-03 04:26:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:02,858 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2021-11-03 04:26:02,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2021-11-03 04:26:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-03 04:26:02,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:02,862 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2021-11-03 04:26:02,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:26:03,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-03 04:26:03,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash -194452356, now seen corresponding path program 3 times [2021-11-03 04:26:03,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:03,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127020034] [2021-11-03 04:26:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:03,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:03,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:03,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127020034] [2021-11-03 04:26:03,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127020034] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:03,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207154663] [2021-11-03 04:26:03,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:26:03,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:03,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:03,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 04:26:03,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:26:03,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:26:03,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-03 04:26:03,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:26:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:04,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207154663] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:26:04,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1726246315] [2021-11-03 04:26:04,818 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:26:04,818 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:26:04,818 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:26:04,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:26:04,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2021-11-03 04:26:04,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833106973] [2021-11-03 04:26:04,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-03 04:26:04,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-03 04:26:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2021-11-03 04:26:04,823 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:05,463 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2021-11-03 04:26:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-03 04:26:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-03 04:26:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:05,466 INFO L225 Difference]: With dead ends: 190 [2021-11-03 04:26:05,467 INFO L226 Difference]: Without dead ends: 189 [2021-11-03 04:26:05,469 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2021-11-03 04:26:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-03 04:26:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2021-11-03 04:26:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.0062111801242235) internal successors, (162), 161 states have internal predecessors, (162), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2021-11-03 04:26:05,481 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2021-11-03 04:26:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:05,481 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2021-11-03 04:26:05,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2021-11-03 04:26:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-03 04:26:05,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:05,486 INFO L513 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2021-11-03 04:26:05,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 04:26:05,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:05,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:05,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -309111976, now seen corresponding path program 4 times [2021-11-03 04:26:05,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:05,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230496311] [2021-11-03 04:26:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:05,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:06,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:06,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230496311] [2021-11-03 04:26:06,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230496311] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:06,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424227620] [2021-11-03 04:26:06,667 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:26:06,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:06,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:06,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 04:26:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:06,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-03 04:26:06,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:07,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:26:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:09,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424227620] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:26:09,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541091453] [2021-11-03 04:26:09,806 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:26:09,806 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:26:09,807 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:26:09,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:26:09,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2021-11-03 04:26:09,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860486827] [2021-11-03 04:26:09,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2021-11-03 04:26:09,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-11-03 04:26:09,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2021-11-03 04:26:09,819 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:11,752 INFO L93 Difference]: Finished difference Result 382 states and 405 transitions. [2021-11-03 04:26:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-03 04:26:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-11-03 04:26:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:11,759 INFO L225 Difference]: With dead ends: 382 [2021-11-03 04:26:11,759 INFO L226 Difference]: Without dead ends: 381 [2021-11-03 04:26:11,775 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2021-11-03 04:26:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-03 04:26:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2021-11-03 04:26:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 329 states have (on average 1.0030395136778116) internal successors, (330), 329 states have internal predecessors, (330), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2021-11-03 04:26:11,799 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2021-11-03 04:26:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:11,801 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2021-11-03 04:26:11,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2021-11-03 04:26:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-11-03 04:26:11,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:11,819 INFO L513 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2021-11-03 04:26:11,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 04:26:12,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-03 04:26:12,035 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash 956449040, now seen corresponding path program 5 times [2021-11-03 04:26:12,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:12,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797118497] [2021-11-03 04:26:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:12,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:15,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:15,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797118497] [2021-11-03 04:26:15,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797118497] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:15,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402785804] [2021-11-03 04:26:15,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:26:15,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:15,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:15,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 04:26:15,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-03 04:26:15,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:26:15,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-03 04:26:15,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:16,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:26:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:23,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402785804] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:26:23,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970133952] [2021-11-03 04:26:23,794 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:26:23,794 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:26:23,794 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:26:23,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:26:23,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2021-11-03 04:26:23,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591606027] [2021-11-03 04:26:23,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2021-11-03 04:26:23,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:26:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2021-11-03 04:26:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2021-11-03 04:26:23,814 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:26:31,334 INFO L93 Difference]: Finished difference Result 766 states and 813 transitions. [2021-11-03 04:26:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2021-11-03 04:26:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2021-11-03 04:26:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:26:31,340 INFO L225 Difference]: With dead ends: 766 [2021-11-03 04:26:31,340 INFO L226 Difference]: Without dead ends: 765 [2021-11-03 04:26:31,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2021-11-03 04:26:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-03 04:26:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 761. [2021-11-03 04:26:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 665 states have (on average 1.0015037593984963) internal successors, (666), 665 states have internal predecessors, (666), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2021-11-03 04:26:31,389 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2021-11-03 04:26:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:26:31,390 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2021-11-03 04:26:31,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:26:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2021-11-03 04:26:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2021-11-03 04:26:31,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:26:31,414 INFO L513 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1] [2021-11-03 04:26:31,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 04:26:31,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-03 04:26:31,639 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:26:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:26:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1565023360, now seen corresponding path program 6 times [2021-11-03 04:26:31,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:26:31,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407852697] [2021-11-03 04:26:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:26:31,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:26:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:26:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:41,833 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:26:41,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407852697] [2021-11-03 04:26:41,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407852697] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:26:41,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511322969] [2021-11-03 04:26:41,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:26:41,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:26:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:26:41,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:26:41,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 04:26:42,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:26:42,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:26:42,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 192 conjunts are in the unsatisfiable core [2021-11-03 04:26:42,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:26:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:26:44,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:27:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:27:09,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511322969] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:27:09,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1959249860] [2021-11-03 04:27:09,898 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:27:09,898 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:27:09,899 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:27:09,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:27:09,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2021-11-03 04:27:09,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082129178] [2021-11-03 04:27:09,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2021-11-03 04:27:09,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:27:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2021-11-03 04:27:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2021-11-03 04:27:09,933 INFO L87 Difference]: Start difference. First operand 761 states and 761 transitions. Second operand has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:27:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:27:55,314 INFO L93 Difference]: Finished difference Result 1534 states and 1629 transitions. [2021-11-03 04:27:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2021-11-03 04:27:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 760 [2021-11-03 04:27:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:27:55,326 INFO L225 Difference]: With dead ends: 1534 [2021-11-03 04:27:55,326 INFO L226 Difference]: Without dead ends: 1533 [2021-11-03 04:27:55,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1900 GetRequests, 1328 SyntacticMatches, 0 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71820 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=91301, Invalid=237601, Unknown=0, NotChecked=0, Total=328902 [2021-11-03 04:27:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2021-11-03 04:27:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1529. [2021-11-03 04:27:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1337 states have (on average 1.0007479431563202) internal successors, (1338), 1337 states have internal predecessors, (1338), 191 states have call successors, (191), 191 states have call predecessors, (191), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:27:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1529 transitions. [2021-11-03 04:27:55,432 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1529 transitions. Word has length 760 [2021-11-03 04:27:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:27:55,434 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 1529 transitions. [2021-11-03 04:27:55,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:27:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1529 transitions. [2021-11-03 04:27:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1529 [2021-11-03 04:27:55,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:27:55,539 INFO L513 BasicCegarLoop]: trace histogram [191, 191, 191, 190, 190, 190, 190, 190, 1, 1, 1, 1, 1] [2021-11-03 04:27:55,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 04:27:55,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:27:55,767 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-03 04:27:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:27:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash 594908000, now seen corresponding path program 7 times [2021-11-03 04:27:55,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:27:55,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575680721] [2021-11-03 04:27:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:27:55,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:27:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:28:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:28:34,494 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:28:34,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575680721] [2021-11-03 04:28:34,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575680721] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:28:34,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164983585] [2021-11-03 04:28:34,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:28:34,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:28:34,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:28:34,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:28:34,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151d2431-a73c-41db-9737-8e9706152700/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 04:28:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:28:36,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 3094 conjuncts, 384 conjunts are in the unsatisfiable core [2021-11-03 04:28:36,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:28:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:28:40,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:30:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:17,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164983585] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:30:17,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1165328258] [2021-11-03 04:30:17,574 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 04:30:17,574 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:30:17,575 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:30:17,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:30:17,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [384, 384, 384] total 767 [2021-11-03 04:30:17,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581053075] [2021-11-03 04:30:17,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 768 states [2021-11-03 04:30:17,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 768 interpolants. [2021-11-03 04:30:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147076, Invalid=441980, Unknown=0, NotChecked=0, Total=589056 [2021-11-03 04:30:17,671 INFO L87 Difference]: Start difference. First operand 1529 states and 1529 transitions. Second operand has 768 states, 767 states have (on average 3.485006518904824) internal successors, (2673), 386 states have internal predecessors, (2673), 382 states have call successors, (382), 382 states have call predecessors, (382), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)