./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/TerminatorRec02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/TerminatorRec02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs --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 64bit --witnessprinter.graph.data.programhash 744c3d26555bbd53a7a0d9e7c64efe010ba06d0f67ec9ca21eb74ed1148222d3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 15:47:41,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 15:47:41,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 15:47:41,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 15:47:41,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 15:47:41,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 15:47:41,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 15:47:41,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 15:47:41,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 15:47:41,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 15:47:41,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 15:47:41,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 15:47:41,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 15:47:41,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 15:47:41,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 15:47:41,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 15:47:41,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 15:47:41,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 15:47:41,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 15:47:41,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 15:47:41,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 15:47:41,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 15:47:41,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 15:47:41,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 15:47:41,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 15:47:41,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 15:47:41,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 15:47:41,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 15:47:41,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 15:47:41,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 15:47:41,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 15:47:41,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 15:47:41,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 15:47:41,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 15:47:41,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 15:47:41,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 15:47:41,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 15:47:41,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 15:47:41,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 15:47:41,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 15:47:41,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 15:47:41,857 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/config/svcomp-Overflow-64bit-Taipan_Default.epf [2021-11-19 15:47:41,920 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 15:47:41,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 15:47:41,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 15:47:41,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 15:47:41,922 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 15:47:41,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 15:47:41,923 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 15:47:41,923 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 15:47:41,931 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 15:47:41,931 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 15:47:41,932 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 15:47:41,932 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 15:47:41,932 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 15:47:41,933 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 15:47:41,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 15:47:41,934 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 15:47:41,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 15:47:41,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 15:47:41,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 15:47:41,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 15:47:41,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 15:47:41,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 15:47:41,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 15:47:41,936 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-19 15:47:41,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 15:47:41,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 15:47:41,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 15:47:41,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 15:47:41,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 15:47:41,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:47:41,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 15:47:41,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 15:47:41,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 15:47:41,939 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 15:47:41,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 15:47:41,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 15:47:41,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 15:47:41,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 15:47:41,941 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_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/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_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 744c3d26555bbd53a7a0d9e7c64efe010ba06d0f67ec9ca21eb74ed1148222d3 [2021-11-19 15:47:42,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 15:47:42,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 15:47:42,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 15:47:42,367 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 15:47:42,368 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 15:47:42,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/termination-numeric/TerminatorRec02.c [2021-11-19 15:47:42,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/data/8b5d1c302/98deb3c3182744c486de16e388990136/FLAG4b4c29ff2 [2021-11-19 15:47:43,106 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 15:47:43,108 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/sv-benchmarks/c/termination-numeric/TerminatorRec02.c [2021-11-19 15:47:43,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/data/8b5d1c302/98deb3c3182744c486de16e388990136/FLAG4b4c29ff2 [2021-11-19 15:47:43,466 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/data/8b5d1c302/98deb3c3182744c486de16e388990136 [2021-11-19 15:47:43,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 15:47:43,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 15:47:43,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 15:47:43,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 15:47:43,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 15:47:43,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28584bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43, skipping insertion in model container [2021-11-19 15:47:43,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 15:47:43,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 15:47:43,636 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:47:43,640 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 15:47:43,656 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:47:43,670 INFO L208 MainTranslator]: Completed translation [2021-11-19 15:47:43,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43 WrapperNode [2021-11-19 15:47:43,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 15:47:43,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 15:47:43,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 15:47:43,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 15:47:43,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,708 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2021-11-19 15:47:43,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 15:47:43,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 15:47:43,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 15:47:43,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 15:47:43,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 15:47:43,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 15:47:43,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 15:47:43,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 15:47:43,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (1/1) ... [2021-11-19 15:47:43,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:47:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:47:43,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 15:47:43,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 15:47:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2021-11-19 15:47:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2021-11-19 15:47:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 15:47:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 15:47:43,910 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 15:47:43,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 15:47:44,122 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 15:47:44,150 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 15:47:44,151 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 15:47:44,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:47:44 BoogieIcfgContainer [2021-11-19 15:47:44,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 15:47:44,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 15:47:44,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 15:47:44,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 15:47:44,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:47:43" (1/3) ... [2021-11-19 15:47:44,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aedf61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:47:44, skipping insertion in model container [2021-11-19 15:47:44,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:47:43" (2/3) ... [2021-11-19 15:47:44,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aedf61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:47:44, skipping insertion in model container [2021-11-19 15:47:44,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:47:44" (3/3) ... [2021-11-19 15:47:44,165 INFO L111 eAbstractionObserver]: Analyzing ICFG TerminatorRec02.c [2021-11-19 15:47:44,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 15:47:44,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-19 15:47:44,249 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 15:47:44,264 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-19 15:47:44,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-19 15:47:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:47:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 15:47:44,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:44,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:44,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:47:44,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1793613479, now seen corresponding path program 1 times [2021-11-19 15:47:44,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:47:44,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210515142] [2021-11-19 15:47:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:44,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:47:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:44,604 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-19 15:47:44,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:47:44,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210515142] [2021-11-19 15:47:44,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210515142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:44,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:44,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 15:47:44,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78603808] [2021-11-19 15:47:44,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:44,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:47:44,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:47:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:47:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:47:44,667 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:47:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:44,775 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-11-19 15:47:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 15:47:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-19 15:47:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:44,797 INFO L225 Difference]: With dead ends: 21 [2021-11-19 15:47:44,797 INFO L226 Difference]: Without dead ends: 17 [2021-11-19 15:47:44,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:47:44,809 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:44,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:47:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-19 15:47:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-19 15:47:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:47:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-19 15:47:44,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 7 [2021-11-19 15:47:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:44,856 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-19 15:47:44,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:47:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-19 15:47:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 15:47:44,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:44,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:44,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 15:47:44,859 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:47:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -232556962, now seen corresponding path program 1 times [2021-11-19 15:47:44,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:47:44,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671180132] [2021-11-19 15:47:44,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:44,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:47:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:44,930 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-19 15:47:44,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:47:44,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671180132] [2021-11-19 15:47:44,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671180132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:44,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:44,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 15:47:44,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986981381] [2021-11-19 15:47:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:44,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 15:47:44,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:47:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 15:47:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:47:44,942 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-19 15:47:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:44,982 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-11-19 15:47:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 15:47:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-19 15:47:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:44,986 INFO L225 Difference]: With dead ends: 19 [2021-11-19 15:47:44,986 INFO L226 Difference]: Without dead ends: 18 [2021-11-19 15:47:44,987 INFO L932 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-19 15:47:44,989 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:44,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:47:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-19 15:47:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2021-11-19 15:47:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:47:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-19 15:47:45,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2021-11-19 15:47:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:45,007 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-19 15:47:45,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-19 15:47:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-19 15:47:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 15:47:45,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:45,014 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:45,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 15:47:45,015 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:47:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1327230598, now seen corresponding path program 1 times [2021-11-19 15:47:45,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:47:45,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896811538] [2021-11-19 15:47:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:45,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:47:45,037 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:47:45,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867434703] [2021-11-19 15:47:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:45,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:47:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:47:45,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:47:45,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 15:47:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:45,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 15:47:45,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:47:45,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:47:45,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:47:45,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896811538] [2021-11-19 15:47:45,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-19 15:47:45,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867434703] [2021-11-19 15:47:45,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867434703] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:47:45,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616880272] [2021-11-19 15:47:45,548 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-19 15:47:45,548 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:47:45,554 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:47:45,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:47:45,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-11-19 15:47:45,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399841841] [2021-11-19 15:47:45,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 15:47:45,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 15:47:45,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:47:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 15:47:45,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-19 15:47:45,560 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:45,696 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-11-19 15:47:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 15:47:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-19 15:47:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:45,698 INFO L225 Difference]: With dead ends: 25 [2021-11-19 15:47:45,699 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 15:47:45,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-11-19 15:47:45,701 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:45,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2021-11-19 15:47:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 15:47:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-11-19 15:47:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-11-19 15:47:45,709 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2021-11-19 15:47:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:45,709 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-11-19 15:47:45,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-11-19 15:47:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 15:47:45,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:45,711 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:45,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 15:47:45,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-19 15:47:45,939 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:47:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1805524379, now seen corresponding path program 1 times [2021-11-19 15:47:45,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:47:45,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024138769] [2021-11-19 15:47:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:45,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:47:45,956 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:47:45,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613050685] [2021-11-19 15:47:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:45,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:47:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:47:45,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:47:45,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 15:47:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:46,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 15:47:46,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 15:47:46,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-19 15:47:46,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:47:46,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024138769] [2021-11-19 15:47:46,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-19 15:47:46,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613050685] [2021-11-19 15:47:46,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613050685] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 15:47:46,907 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:47:46,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2021-11-19 15:47:46,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664418890] [2021-11-19 15:47:46,908 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 15:47:46,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 15:47:46,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:47:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 15:47:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-19 15:47:46,910 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:47:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:47:46,970 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-11-19 15:47:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 15:47:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-11-19 15:47:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:47:46,973 INFO L225 Difference]: With dead ends: 24 [2021-11-19 15:47:46,973 INFO L226 Difference]: Without dead ends: 23 [2021-11-19 15:47:46,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-19 15:47:46,977 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:47:46,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-11-19 15:47:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-19 15:47:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2021-11-19 15:47:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 15:47:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-11-19 15:47:46,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2021-11-19 15:47:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:47:46,985 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-11-19 15:47:46,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:47:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-11-19 15:47:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-19 15:47:46,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:47:46,987 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:47:47,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 15:47:47,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:47:47,211 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:47:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:47:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1409824997, now seen corresponding path program 1 times [2021-11-19 15:47:47,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:47:47,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108302202] [2021-11-19 15:47:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:47,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:47:47,224 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:47:47,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598375239] [2021-11-19 15:47:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:47:47,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:47:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:47:47,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:47:47,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 15:47:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:47:47,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-19 15:47:47,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:47:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 15:47:47,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:47:56,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~x_BEFORE_CALL_8 Int) (v_fact_~y~0_8 Int) (|v_fact_#in~x_BEFORE_CALL_2| Int)) (or (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_8) (<= (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|)) 2147483647) (and (exists ((v_fact_~y~0_8 Int)) (and (<= v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|) (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))))) (<= |v_fact_#in~x_BEFORE_CALL_2| 2)) (< (* v_fact_~x_BEFORE_CALL_8 |c_fact_#res|) v_fact_~y~0_8) (and (< 2 |v_fact_#in~x_BEFORE_CALL_2|) (exists ((v_fact_~y~0_8 Int)) (and (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))) (<= v_fact_~y~0_8 v_fact_~x_BEFORE_CALL_8))) (<= v_fact_~x_BEFORE_CALL_8 2)))) is different from false [2021-11-19 15:48:09,561 WARN L860 $PredicateComparison]: unable to prove that (or (< 1 |c_fact_#in~x|) (forall ((v_fact_~x_BEFORE_CALL_8 Int) (v_fact_~y~0_8 Int) (|v_fact_#in~x_BEFORE_CALL_2| Int)) (or (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_8) (<= (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|)) 2147483647) (and (exists ((v_fact_~y~0_8 Int)) (and (<= v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|) (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))))) (<= |v_fact_#in~x_BEFORE_CALL_2| 2)) (and (< 2 |v_fact_#in~x_BEFORE_CALL_2|) (exists ((v_fact_~y~0_8 Int)) (and (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))) (<= v_fact_~y~0_8 v_fact_~x_BEFORE_CALL_8)))) (< v_fact_~x_BEFORE_CALL_8 v_fact_~y~0_8)))) is different from true [2021-11-19 15:48:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-11-19 15:48:09,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:48:09,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108302202] [2021-11-19 15:48:09,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-19 15:48:09,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598375239] [2021-11-19 15:48:09,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598375239] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:48:09,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280071101] [2021-11-19 15:48:09,763 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-19 15:48:09,763 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:48:09,763 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:48:09,772 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:48:09,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-11-19 15:48:09,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69901013] [2021-11-19 15:48:09,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 15:48:09,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 15:48:09,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:48:09,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 15:48:09,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=275, Unknown=4, NotChecked=70, Total=420 [2021-11-19 15:48:09,776 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:48:11,824 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_fact_~x_BEFORE_CALL_8 Int) (v_fact_~y~0_8 Int) (|v_fact_#in~x_BEFORE_CALL_2| Int)) (or (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_8) (<= (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|)) 2147483647) (and (exists ((v_fact_~y~0_8 Int)) (and (<= v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|) (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))))) (<= |v_fact_#in~x_BEFORE_CALL_2| 2)) (< (* v_fact_~x_BEFORE_CALL_8 |c_fact_#res|) v_fact_~y~0_8) (and (< 2 |v_fact_#in~x_BEFORE_CALL_2|) (exists ((v_fact_~y~0_8 Int)) (and (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))) (<= v_fact_~y~0_8 v_fact_~x_BEFORE_CALL_8))) (<= v_fact_~x_BEFORE_CALL_8 2)))) (= c_fact_~x |c_fact_#in~x|) (= |c_fact_#res| 1) (<= |c_fact_#in~x| 1)) is different from false [2021-11-19 15:48:13,837 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_fact_~x_BEFORE_CALL_8 Int) (v_fact_~y~0_8 Int) (|v_fact_#in~x_BEFORE_CALL_2| Int)) (or (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_8) (<= (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|)) 2147483647) (and (exists ((v_fact_~y~0_8 Int)) (and (<= v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|) (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))))) (<= |v_fact_#in~x_BEFORE_CALL_2| 2)) (< (* v_fact_~x_BEFORE_CALL_8 |c_fact_#res|) v_fact_~y~0_8) (and (< 2 |v_fact_#in~x_BEFORE_CALL_2|) (exists ((v_fact_~y~0_8 Int)) (and (< 2147483647 (+ v_fact_~y~0_8 (* v_fact_~y~0_8 |v_fact_#in~x_BEFORE_CALL_2|))) (<= v_fact_~y~0_8 v_fact_~x_BEFORE_CALL_8))) (<= v_fact_~x_BEFORE_CALL_8 2)))) (= |c_fact_#res| 1) (<= |c_fact_#in~x| 1)) is different from false [2021-11-19 15:48:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:48:13,906 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-11-19 15:48:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 15:48:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2021-11-19 15:48:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:48:13,908 INFO L225 Difference]: With dead ends: 31 [2021-11-19 15:48:13,909 INFO L226 Difference]: Without dead ends: 30 [2021-11-19 15:48:13,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=94, Invalid=336, Unknown=6, NotChecked=164, Total=600 [2021-11-19 15:48:13,910 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:48:13,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2021-11-19 15:48:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-19 15:48:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-11-19 15:48:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 15:48:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-11-19 15:48:13,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 30 [2021-11-19 15:48:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:48:13,916 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-19 15:48:13,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:48:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-11-19 15:48:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 15:48:13,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:48:13,918 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:48:13,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-19 15:48:14,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:48:14,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:48:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:48:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -754901904, now seen corresponding path program 1 times [2021-11-19 15:48:14,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:48:14,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082136599] [2021-11-19 15:48:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:48:14,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:48:14,150 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:48:14,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457413707] [2021-11-19 15:48:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:48:14,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:48:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:48:14,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:48:14,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 15:48:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:48:14,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 15:48:14,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:48:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-19 15:48:14,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:48:17,182 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_14 Int) (v_fact_~x_BEFORE_CALL_11 Int)) (or (< v_fact_~y~0_14 |c_fact_#res|) (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (and (<= 1 v_fact_~y~0_17) (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (< 1 v_fact_~x_44) (<= (* v_fact_~y~0_17 v_fact_~x_44) v_fact_~y~0_14))))) is different from true [2021-11-19 15:48:35,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (and (<= 1 v_fact_~y~0_17) (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (< 1 v_fact_~x_44) (<= (* v_fact_~y~0_17 v_fact_~x_44) v_fact_~y~0_14))) (< v_fact_~y~0_14 (* v_fact_~y~0_18 c_fact_~x)) (< v_fact_~y~0_18 1))) is different from false [2021-11-19 15:48:40,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int) (v_fact_~x_BEFORE_CALL_12 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (< v_fact_~y~0_18 |c_fact_#res|) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (and (<= 1 v_fact_~y~0_17) (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (< 1 v_fact_~x_44) (<= (* v_fact_~y~0_17 v_fact_~x_44) v_fact_~y~0_14))) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int)) (and (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (<= 1 v_fact_~y~0_18) (<= (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12) v_fact_~y~0_14) (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (<= v_fact_~x_44 1) (< v_fact_~y~0_17 1) (< v_fact_~y~0_14 (* v_fact_~y~0_17 v_fact_~x_44)))))) (< v_fact_~y~0_14 (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12)))) is different from false [2021-11-19 15:48:42,288 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int) (v_fact_~x_BEFORE_CALL_12 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (< v_fact_~y~0_18 |c_fact_#res|) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (and (<= 1 v_fact_~y~0_17) (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (< 1 v_fact_~x_44) (<= (* v_fact_~y~0_17 v_fact_~x_44) v_fact_~y~0_14))) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int)) (and (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (<= 1 v_fact_~y~0_18) (<= (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12) v_fact_~y~0_14) (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (<= v_fact_~x_44 1) (< v_fact_~y~0_17 1) (< v_fact_~y~0_14 (* v_fact_~y~0_17 v_fact_~x_44)))))) (< v_fact_~y~0_14 (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12)))) is different from true [2021-11-19 15:48:51,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int) (v_fact_~x_BEFORE_CALL_12 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (and (<= 1 v_fact_~y~0_17) (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (< 1 v_fact_~x_44) (<= (* v_fact_~y~0_17 v_fact_~x_44) v_fact_~y~0_14))) (exists ((v_fact_~y~0_14 Int) (v_fact_~y~0_18 Int) (v_fact_~x_BEFORE_CALL_11 Int)) (and (< (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648) 0) (<= 1 v_fact_~y~0_18) (<= (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12) v_fact_~y~0_14) (forall ((v_fact_~y~0_14 Int) (v_fact_~y~0_17 Int) (v_fact_~x_44 Int)) (or (<= 0 (+ (* v_fact_~y~0_14 v_fact_~x_BEFORE_CALL_11) 2147483648)) (<= v_fact_~x_44 1) (< v_fact_~y~0_17 1) (< v_fact_~y~0_14 (* v_fact_~y~0_17 v_fact_~x_44)))))) (< v_fact_~y~0_14 (* v_fact_~y~0_18 v_fact_~x_BEFORE_CALL_12)) (< v_fact_~y~0_18 1))) is different from false [2021-11-19 15:48:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2021-11-19 15:48:52,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:48:52,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082136599] [2021-11-19 15:48:52,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-19 15:48:52,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457413707] [2021-11-19 15:48:52,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457413707] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:48:52,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [519374569] [2021-11-19 15:48:52,805 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-19 15:48:52,805 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:48:52,805 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:48:52,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:48:52,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-19 15:48:52,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080963786] [2021-11-19 15:48:52,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 15:48:52,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 15:48:52,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:48:52,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 15:48:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=154, Unknown=9, NotChecked=84, Total=306 [2021-11-19 15:48:52,808 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:49:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:49:08,116 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-11-19 15:49:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 15:49:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2021-11-19 15:49:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:49:08,119 INFO L225 Difference]: With dead ends: 25 [2021-11-19 15:49:08,119 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 15:49:08,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=12, NotChecked=90, Total=342 [2021-11-19 15:49:08,121 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:49:08,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 84 Unchecked, 0.0s Time] [2021-11-19 15:49:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 15:49:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-19 15:49:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 15:49:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-11-19 15:49:08,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 31 [2021-11-19 15:49:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:49:08,128 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-11-19 15:49:08,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:49:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-11-19 15:49:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-19 15:49:08,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:49:08,129 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-19 15:49:08,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-19 15:49:08,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:49:08,334 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:49:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:49:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash -78458362, now seen corresponding path program 2 times [2021-11-19 15:49:08,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:49:08,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829976719] [2021-11-19 15:49:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:49:08,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:49:08,355 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:49:08,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553727876] [2021-11-19 15:49:08,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:49:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:49:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:49:08,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:49:08,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 15:49:08,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-19 15:49:08,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:49:08,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-19 15:49:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:49:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-19 15:49:08,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:50:04,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (< |c_fact_#res| v_fact_~y~0_28) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) is different from false [2021-11-19 15:50:46,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int) (v_fact_~y~0_20 Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (* c_fact_~y~0 c_fact_~x) v_fact_~y~0_28) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) is different from false [2021-11-19 15:51:31,571 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int) (v_fact_~y~0_20 Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (* c_fact_~x |c_fact_#t~ret0|) v_fact_~y~0_28) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) is different from false [2021-11-19 15:55:27,303 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int)) (or (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (< 2 v_fact_~y~0_28) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28)))) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (< 2 |c_fact_#in~x|)) is different from true [2021-11-19 15:55:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 13 refuted. 4 times theorem prover too weak. 3 trivial. 9 not checked. [2021-11-19 15:55:40,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:55:40,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829976719] [2021-11-19 15:55:40,629 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-19 15:55:40,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553727876] [2021-11-19 15:55:40,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553727876] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:55:40,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [277951015] [2021-11-19 15:55:40,631 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-19 15:55:40,632 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:55:40,632 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:55:40,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:55:40,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2021-11-19 15:55:40,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718623331] [2021-11-19 15:55:40,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-19 15:55:40,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 15:55:40,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:55:40,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 15:55:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=472, Unknown=18, NotChecked=196, Total=812 [2021-11-19 15:55:40,636 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 15:55:42,725 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_fact_#in~x| c_fact_~x) (<= |c_fact_#t~ret0| 2) (<= c_fact_~x 2) (= |c_fact_#t~ret0| 1) (<= c_fact_~x 3) (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int) (v_fact_~y~0_20 Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (* c_fact_~x |c_fact_#t~ret0|) v_fact_~y~0_28) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (< 1 c_fact_~x)) is different from false [2021-11-19 15:55:44,732 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_fact_#in~x| c_fact_~x) (= c_fact_~y~0 1) (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int) (v_fact_~y~0_20 Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (* c_fact_~y~0 c_fact_~x) v_fact_~y~0_28) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= c_fact_~x 2) (<= c_fact_~x 3) (<= c_fact_~y~0 2) (< 1 c_fact_~x)) is different from false [2021-11-19 15:55:46,766 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_fact_#res| 2) (forall ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~x_BEFORE_CALL_17 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int) (|v_fact_#in~x_BEFORE_CALL_5| Int)) (or (and (<= v_fact_~x_BEFORE_CALL_17 3) (exists ((v_fact_~x_BEFORE_CALL_16 Int) (v_fact_~y~0_28 Int) (v_fact_~y~0_20 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (<= v_fact_~x_BEFORE_CALL_16 (+ |v_fact_#in~x_BEFORE_CALL_5| 1)) (<= v_fact_~y~0_28 2) (forall ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (or (<= v_fact_~x_68 1) (< (+ v_fact_~x_68 1) v_fact_~x_BEFORE_CALL_16) (< (* v_fact_~y~0_27 v_fact_~x_68) v_fact_~y~0_20) (< 2 v_fact_~y~0_27) (< 3 v_fact_~x_68) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= v_fact_~y~0_20 (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28))))) (< (+ |v_fact_#in~x_BEFORE_CALL_5| 1) v_fact_~x_BEFORE_CALL_16) (exists ((v_fact_~y~0_27 Int) (v_fact_~y~0_20 Int) (v_fact_~x_68 Int)) (and (< 2147483647 (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20)) (< 1 v_fact_~x_68) (<= v_fact_~x_68 3) (<= v_fact_~y~0_20 (* v_fact_~y~0_27 v_fact_~x_68)) (<= v_fact_~x_BEFORE_CALL_16 (+ v_fact_~x_68 1)) (<= v_fact_~y~0_27 2))) (< (+ |c_fact_#in~x| 1) v_fact_~x_BEFORE_CALL_17) (< (* v_fact_~x_BEFORE_CALL_17 v_fact_~y~0_28) v_fact_~y~0_20) (< |c_fact_#res| v_fact_~y~0_28) (<= (* v_fact_~x_BEFORE_CALL_16 v_fact_~y~0_20) 2147483647))) (<= |c_fact_#in~x| 2)) is different from false [2021-11-19 15:55:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:55:46,853 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-11-19 15:55:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 15:55:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2021-11-19 15:55:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:55:46,855 INFO L225 Difference]: With dead ends: 34 [2021-11-19 15:55:46,855 INFO L226 Difference]: Without dead ends: 33 [2021-11-19 15:55:46,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=160, Invalid=549, Unknown=21, NotChecked=392, Total=1122 [2021-11-19 15:55:46,857 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:55:46,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 188 Unchecked, 0.1s Time] [2021-11-19 15:55:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-11-19 15:55:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-11-19 15:55:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 15:55:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-11-19 15:55:46,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 35 [2021-11-19 15:55:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:55:46,867 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-11-19 15:55:46,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 15:55:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-11-19 15:55:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-19 15:55:46,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:55:46,869 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-19 15:55:46,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-19 15:55:47,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-19 15:55:47,075 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-11-19 15:55:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:55:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1046871141, now seen corresponding path program 3 times [2021-11-19 15:55:47,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:55:47,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432113813] [2021-11-19 15:55:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:55:47,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:55:47,096 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-19 15:55:47,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496326687] [2021-11-19 15:55:47,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:55:47,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:55:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:55:47,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:55:47,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db37ad-9598-43c8-8324-73124cd3c26d/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 15:55:47,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:55:47,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:55:47,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 15:55:47,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:55:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-19 15:55:48,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:55:57,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_35 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_49 Int)) (or (< (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49)) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (< |c_fact_#res| v_fact_~y~0_49) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_35 (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49))) (<= (+ v_fact_~y~0_56 1) |c_fact_#in~x|) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |c_fact_#in~x|)))) (<= |c_fact_#in~x| 3) (< 1 |c_fact_#in~x|)))) is different from false [2021-11-19 15:56:00,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_35 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_49 Int)) (or (< (* c_fact_~y~0 c_fact_~x) v_fact_~y~0_49) (< (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49)) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_35 (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49))) (<= (+ v_fact_~y~0_56 1) |c_fact_#in~x|) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |c_fact_#in~x|)))) (<= |c_fact_#in~x| 3) (< 1 |c_fact_#in~x|)))) is different from false [2021-11-19 15:56:03,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_57 Int)) (or (< |c_fact_#t~ret0| v_fact_~y~0_57) (forall ((v_fact_~y~0_35 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_49 Int)) (or (< (* v_fact_~y~0_57 c_fact_~x) v_fact_~y~0_49) (< (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49)) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_35 (+ v_fact_~y~0_49 (* |c_fact_#in~x| v_fact_~y~0_49))) (<= (+ v_fact_~y~0_56 1) |c_fact_#in~x|) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |c_fact_#in~x|)))) (<= |c_fact_#in~x| 3) (< 1 |c_fact_#in~x|)))))) is different from false [2021-11-19 15:56:32,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_35 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_57 Int) (v_fact_~y~0_49 Int) (|v_fact_#in~x_BEFORE_CALL_11| Int)) (or (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|)) (<= (+ v_fact_~y~0_56 1) |v_fact_#in~x_BEFORE_CALL_11|))) (<= |v_fact_#in~x_BEFORE_CALL_11| 3) (< 1 |v_fact_#in~x_BEFORE_CALL_11|)) (< |c_fact_#res| v_fact_~y~0_57) (< (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57) v_fact_~y~0_49) (and (exists ((|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_35 Int) (v_fact_~y~0_57 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (or (forall ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (or (< (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) (< |v_fact_#in~x_BEFORE_CALL_11| (+ v_fact_~y~0_56 1)) (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647))) (< 3 |v_fact_#in~x_BEFORE_CALL_11|) (<= |v_fact_#in~x_BEFORE_CALL_11| 1)) (<= v_fact_~y~0_49 (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57)) (<= v_fact_~y~0_57 |c_fact_#in~x|))) (<= |c_fact_#in~x| 2)))) is different from false [2021-11-19 15:57:36,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_35 Int) (v_fact_~y~0_57 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_49 Int) (|v_fact_#in~x_BEFORE_CALL_11| Int)) (or (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (< (* c_fact_~y~0 c_fact_~x) v_fact_~y~0_57) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|)) (<= (+ v_fact_~y~0_56 1) |v_fact_#in~x_BEFORE_CALL_11|))) (<= |v_fact_#in~x_BEFORE_CALL_11| 3) (< 1 |v_fact_#in~x_BEFORE_CALL_11|)) (< (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57) v_fact_~y~0_49) (and (exists ((|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_35 Int) (v_fact_~y~0_57 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (or (forall ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (or (< (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) (< |v_fact_#in~x_BEFORE_CALL_11| (+ v_fact_~y~0_56 1)) (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647))) (< 3 |v_fact_#in~x_BEFORE_CALL_11|) (<= |v_fact_#in~x_BEFORE_CALL_11| 1)) (<= v_fact_~y~0_49 (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57)) (<= v_fact_~y~0_57 |c_fact_#in~x|))) (<= |c_fact_#in~x| 2)))) is different from false [2021-11-19 15:59:07,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_fact_~y~0_57 Int) (v_fact_~y~0_35 Int) (|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_49 Int) (|v_fact_#in~x_BEFORE_CALL_11| Int)) (or (< (* c_fact_~x |c_fact_#t~ret0|) v_fact_~y~0_57) (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647) (and (exists ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (<= v_fact_~y~0_49 (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|)) (<= (+ v_fact_~y~0_56 1) |v_fact_#in~x_BEFORE_CALL_11|))) (<= |v_fact_#in~x_BEFORE_CALL_11| 3) (< 1 |v_fact_#in~x_BEFORE_CALL_11|)) (< (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57) v_fact_~y~0_49) (and (exists ((|v_fact_#in~x_BEFORE_CALL_10| Int) (v_fact_~y~0_35 Int) (v_fact_~y~0_57 Int) (v_fact_~y~0_49 Int)) (and (<= v_fact_~y~0_35 (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49)) (< 2147483647 (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|))) (or (forall ((v_fact_~y~0_35 Int) (v_fact_~y~0_56 Int) (v_fact_~y~0_49 Int)) (or (< (* v_fact_~y~0_56 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) (< |v_fact_#in~x_BEFORE_CALL_11| (+ v_fact_~y~0_56 1)) (< (+ (* v_fact_~y~0_49 |v_fact_#in~x_BEFORE_CALL_11|) v_fact_~y~0_49) v_fact_~y~0_35) (<= (+ v_fact_~y~0_35 (* v_fact_~y~0_35 |v_fact_#in~x_BEFORE_CALL_10|)) 2147483647))) (< 3 |v_fact_#in~x_BEFORE_CALL_11|) (<= |v_fact_#in~x_BEFORE_CALL_11| 1)) (<= v_fact_~y~0_49 (+ (* v_fact_~y~0_57 |c_fact_#in~x|) v_fact_~y~0_57)) (<= v_fact_~y~0_57 |c_fact_#in~x|))) (<= |c_fact_#in~x| 2)))) is different from false