./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_09_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bffefb0128963eddccd70c656d6e408fe9453fa6298b0e3aa72430710eae99a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:48:33,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:48:33,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:48:33,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:48:33,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:48:33,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:48:33,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:48:33,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:48:33,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:48:33,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:48:33,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:48:33,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:48:33,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:48:33,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:48:33,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:48:33,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:48:33,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:48:33,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:48:33,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:48:33,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:48:33,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:48:33,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:48:33,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:48:33,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:48:33,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:48:33,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:48:33,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:48:33,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:48:33,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:48:33,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:48:33,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:48:33,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:48:33,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:48:33,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:48:33,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:48:33,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:48:33,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:48:33,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:48:33,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:48:33,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:48:33,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:48:33,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 15:48:33,860 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:48:33,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:48:33,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:48:33,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:48:33,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:48:33,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:48:33,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:48:33,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:48:33,864 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:48:33,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:48:33,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:48:33,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:48:33,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:48:33,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:48:33,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:48:33,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:48:33,867 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 15:48:33,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:48:33,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:48:33,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:48:33,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:48:33,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:48:33,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:48:33,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:48:33,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:48:33,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:48:33,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:48:33,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:48:33,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:48:33,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:48:33,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:48:33,883 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:48:33,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:48:33,884 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/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_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer 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 -> bffefb0128963eddccd70c656d6e408fe9453fa6298b0e3aa72430710eae99a7 [2022-11-25 15:48:34,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:48:34,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:48:34,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:48:34,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:48:34,206 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:48:34,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_09_good.i [2022-11-25 15:48:37,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:48:37,512 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:48:37,513 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_09_good.i [2022-11-25 15:48:37,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/data/7dfcc1fcf/c1a7d40eb9a245588a981e332fa191e2/FLAG01d3f6966 [2022-11-25 15:48:37,570 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/data/7dfcc1fcf/c1a7d40eb9a245588a981e332fa191e2 [2022-11-25 15:48:37,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:48:37,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:48:37,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:48:37,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:48:37,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:48:37,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:48:37" (1/1) ... [2022-11-25 15:48:37,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13261489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:37, skipping insertion in model container [2022-11-25 15:48:37,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:48:37" (1/1) ... [2022-11-25 15:48:37,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:48:37,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:48:37,999 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:48:38,534 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 15:48:38,544 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:48:38,546 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:48:38,557 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:48:38,559 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:48:38,599 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 15:48:38,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:48:38,622 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:48:38,640 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:48:38,682 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 15:48:38,684 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:48:38,685 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:48:38,687 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:48:38,687 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:48:38,694 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 15:48:38,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:48:38,828 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:48:38,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38 WrapperNode [2022-11-25 15:48:38,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:48:38,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:48:38,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:48:38,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:48:38,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,887 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 95 [2022-11-25 15:48:38,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:48:38,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:48:38,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:48:38,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:48:38,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:48:38,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:48:38,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:48:38,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:48:38,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (1/1) ... [2022-11-25 15:48:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:48:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:38,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:48:38,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:48:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 15:48:38,991 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 15:48:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 15:48:38,991 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 15:48:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:48:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 15:48:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:48:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:48:39,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:48:39,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:48:39,463 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:48:39,471 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:48:39,471 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:48:39,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:48:39 BoogieIcfgContainer [2022-11-25 15:48:39,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:48:39,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:48:39,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:48:39,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:48:39,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:48:37" (1/3) ... [2022-11-25 15:48:39,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150365d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:48:39, skipping insertion in model container [2022-11-25 15:48:39,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:48:38" (2/3) ... [2022-11-25 15:48:39,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150365d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:48:39, skipping insertion in model container [2022-11-25 15:48:39,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:48:39" (3/3) ... [2022-11-25 15:48:39,482 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_09_good.i [2022-11-25 15:48:39,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:48:39,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 15:48:39,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:48:39,557 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6630fea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:48:39,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 15:48:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 15:48:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 15:48:39,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:39,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:39,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2010894524, now seen corresponding path program 1 times [2022-11-25 15:48:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:39,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359224089] [2022-11-25 15:48:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359224089] [2022-11-25 15:48:40,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359224089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:40,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:40,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:48:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719373095] [2022-11-25 15:48:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:40,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:48:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:48:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:48:40,071 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:48:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:40,132 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-11-25 15:48:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:48:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-25 15:48:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:40,144 INFO L225 Difference]: With dead ends: 57 [2022-11-25 15:48:40,144 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 15:48:40,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:48:40,151 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:40,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 15:48:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 15:48:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 43 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 15:48:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-11-25 15:48:40,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 12 [2022-11-25 15:48:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-11-25 15:48:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:48:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-11-25 15:48:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 15:48:40,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:40,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:48:40,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2086779133, now seen corresponding path program 1 times [2022-11-25 15:48:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560914372] [2022-11-25 15:48:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:48:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560914372] [2022-11-25 15:48:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560914372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:40,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:40,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:48:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393391194] [2022-11-25 15:48:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:40,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:48:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:48:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:48:40,451 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:48:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:40,522 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-11-25 15:48:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:48:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 15:48:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:40,524 INFO L225 Difference]: With dead ends: 48 [2022-11-25 15:48:40,524 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 15:48:40,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:48:40,526 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:40,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 15:48:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 15:48:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 42 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 15:48:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2022-11-25 15:48:40,536 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 13 [2022-11-25 15:48:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:40,536 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2022-11-25 15:48:40,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 15:48:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-11-25 15:48:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 15:48:40,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:40,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:40,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:48:40,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:40,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1588397300, now seen corresponding path program 1 times [2022-11-25 15:48:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:40,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108049147] [2022-11-25 15:48:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:48:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:40,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108049147] [2022-11-25 15:48:40,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108049147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:40,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:40,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:48:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765816706] [2022-11-25 15:48:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:40,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:40,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:40,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:40,718 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 15:48:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:40,757 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-11-25 15:48:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-25 15:48:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:40,760 INFO L225 Difference]: With dead ends: 81 [2022-11-25 15:48:40,761 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 15:48:40,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:40,763 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:40,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 15:48:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-25 15:48:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 40 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-25 15:48:40,785 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2022-11-25 15:48:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:40,786 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-25 15:48:40,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 15:48:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-25 15:48:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 15:48:40,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:40,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:48:40,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1768789131, now seen corresponding path program 1 times [2022-11-25 15:48:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465060518] [2022-11-25 15:48:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:48:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465060518] [2022-11-25 15:48:40,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465060518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:40,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:40,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:48:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047683666] [2022-11-25 15:48:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:48:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:48:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:48:41,000 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 15:48:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,050 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-25 15:48:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:48:41,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 15:48:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,054 INFO L225 Difference]: With dead ends: 45 [2022-11-25 15:48:41,054 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 15:48:41,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:48:41,058 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 15:48:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 15:48:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-11-25 15:48:41,066 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 22 [2022-11-25 15:48:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,067 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-11-25 15:48:41,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 15:48:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-11-25 15:48:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 15:48:41,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:48:41,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1002111700, now seen corresponding path program 1 times [2022-11-25 15:48:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121192949] [2022-11-25 15:48:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:48:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121192949] [2022-11-25 15:48:41,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121192949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:48:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216507907] [2022-11-25 15:48:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:48:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:48:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:48:41,332 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 15:48:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,414 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-11-25 15:48:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:48:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-25 15:48:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,419 INFO L225 Difference]: With dead ends: 44 [2022-11-25 15:48:41,420 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 15:48:41,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:48:41,423 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:48:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 15:48:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 15:48:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-11-25 15:48:41,439 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 23 [2022-11-25 15:48:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,440 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-11-25 15:48:41,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 15:48:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-11-25 15:48:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:48:41,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:48:41,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -543448431, now seen corresponding path program 1 times [2022-11-25 15:48:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417360935] [2022-11-25 15:48:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:48:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417360935] [2022-11-25 15:48:41,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417360935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:48:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251858624] [2022-11-25 15:48:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,527 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 15:48:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,555 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2022-11-25 15:48:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:41,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-25 15:48:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,556 INFO L225 Difference]: With dead ends: 81 [2022-11-25 15:48:41,556 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 15:48:41,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,558 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 43 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 15:48:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 15:48:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-25 15:48:41,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2022-11-25 15:48:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,565 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-25 15:48:41,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 15:48:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-25 15:48:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:48:41,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:48:41,567 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1708122856, now seen corresponding path program 1 times [2022-11-25 15:48:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297490246] [2022-11-25 15:48:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:48:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:48:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297490246] [2022-11-25 15:48:41,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297490246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:48:41,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9871642] [2022-11-25 15:48:41,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,652 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:48:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,661 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-25 15:48:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-11-25 15:48:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,662 INFO L225 Difference]: With dead ends: 43 [2022-11-25 15:48:41,663 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 15:48:41,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,664 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 15:48:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-25 15:48:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-25 15:48:41,670 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 31 [2022-11-25 15:48:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,670 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-25 15:48:41,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:48:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-25 15:48:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 15:48:41,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:48:41,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1412201096, now seen corresponding path program 1 times [2022-11-25 15:48:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787941527] [2022-11-25 15:48:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:48:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:48:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787941527] [2022-11-25 15:48:41,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787941527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:48:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461616268] [2022-11-25 15:48:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,742 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:48:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,749 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-11-25 15:48:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-25 15:48:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,750 INFO L225 Difference]: With dead ends: 42 [2022-11-25 15:48:41,750 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 15:48:41,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,752 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 15:48:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-25 15:48:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-11-25 15:48:41,757 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2022-11-25 15:48:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,758 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-11-25 15:48:41,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 15:48:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-11-25 15:48:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 15:48:41,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:48:41,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1540798867, now seen corresponding path program 1 times [2022-11-25 15:48:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772241445] [2022-11-25 15:48:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:48:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:48:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:48:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772241445] [2022-11-25 15:48:41,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772241445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:48:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703029128] [2022-11-25 15:48:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,845 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:48:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,851 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-11-25 15:48:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-11-25 15:48:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,853 INFO L225 Difference]: With dead ends: 41 [2022-11-25 15:48:41,853 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 15:48:41,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,854 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 15:48:41,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 15:48:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 15:48:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-11-25 15:48:41,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 40 [2022-11-25 15:48:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,860 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-11-25 15:48:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:48:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-11-25 15:48:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:48:41,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:41,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:48:41,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:48:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash -520124491, now seen corresponding path program 1 times [2022-11-25 15:48:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770255373] [2022-11-25 15:48:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:48:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 15:48:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:48:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:41,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770255373] [2022-11-25 15:48:41,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770255373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:41,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:41,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:48:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471143056] [2022-11-25 15:48:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:48:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:48:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,937 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:48:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:41,943 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-11-25 15:48:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:48:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-25 15:48:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:41,944 INFO L225 Difference]: With dead ends: 40 [2022-11-25 15:48:41,944 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:48:41,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:48:41,946 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:41,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:48:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:48:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:48:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:48:41,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-11-25 15:48:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:41,947 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:48:41,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:48:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:48:41,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:48:41,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 15:48:41,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 15:48:41,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 15:48:41,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 15:48:41,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 15:48:41,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 15:48:41,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 15:48:41,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 15:48:41,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:48:41,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 15:48:42,016 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 15:48:42,016 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 15:48:42,016 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 15:48:42,017 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 15:48:42,017 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 15:48:42,017 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 15:48:42,017 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 15:48:42,017 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: false [2022-11-25 15:48:42,017 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-25 15:48:42,018 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-25 15:48:42,018 INFO L899 garLoopResultBuilder]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2022-11-25 15:48:42,018 INFO L902 garLoopResultBuilder]: At program point L1642(line 1642) the Hoare annotation is: true [2022-11-25 15:48:42,018 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-25 15:48:42,018 INFO L899 garLoopResultBuilder]: For program point L1642-1(line 1642) no Hoare annotation was computed. [2022-11-25 15:48:42,018 INFO L899 garLoopResultBuilder]: For program point L1609-1(line 1609) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 15:48:42,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L902 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: true [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point L1618(lines 1618 1621) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-11-25 15:48:42,020 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1555) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1618-2(lines 1615 1629) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1549 1572) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1629) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1592) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1572) no Hoare annotation was computed. [2022-11-25 15:48:42,021 INFO L902 garLoopResultBuilder]: At program point L1643(lines 1637 1644) the Hoare annotation is: true [2022-11-25 15:48:42,022 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0)) (<= .cse0 0) (<= 0 .cse0))) [2022-11-25 15:48:42,022 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1580) no Hoare annotation was computed. [2022-11-25 15:48:42,022 INFO L899 garLoopResultBuilder]: For program point L1577-2(lines 1574 1593) no Hoare annotation was computed. [2022-11-25 15:48:42,022 INFO L899 garLoopResultBuilder]: For program point L1573(lines 1573 1593) no Hoare annotation was computed. [2022-11-25 15:48:42,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-25 15:48:42,023 INFO L895 garLoopResultBuilder]: At program point L1569(line 1569) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0)) (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 15:48:42,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 15:48:42,023 INFO L899 garLoopResultBuilder]: For program point L1569-1(lines 1556 1571) no Hoare annotation was computed. [2022-11-25 15:48:42,023 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1605) no Hoare annotation was computed. [2022-11-25 15:48:42,023 INFO L895 garLoopResultBuilder]: At program point L1565(line 1565) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0)) (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 15:48:42,024 INFO L899 garLoopResultBuilder]: For program point L1598-1(lines 1595 1613) no Hoare annotation was computed. [2022-11-25 15:48:42,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-25 15:48:42,024 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1613) no Hoare annotation was computed. [2022-11-25 15:48:42,024 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0)) (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 15:48:42,024 INFO L895 garLoopResultBuilder]: At program point L1586(line 1586) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0)) (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 15:48:42,025 INFO L895 garLoopResultBuilder]: At program point L1640(line 1640) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (not (= ~GLOBAL_CONST_TRUE~0 0))) [2022-11-25 15:48:42,025 INFO L899 garLoopResultBuilder]: For program point L1640-1(line 1640) no Hoare annotation was computed. [2022-11-25 15:48:42,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-25 15:48:42,025 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 1570) no Hoare annotation was computed. [2022-11-25 15:48:42,025 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-25 15:48:42,025 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1591) no Hoare annotation was computed. [2022-11-25 15:48:42,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-25 15:48:42,029 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:42,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:48:42,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:48:42 BoogieIcfgContainer [2022-11-25 15:48:42,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:48:42,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:48:42,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:48:42,041 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:48:42,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:48:39" (3/4) ... [2022-11-25 15:48:42,045 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:48:42,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 15:48:42,052 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 15:48:42,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-25 15:48:42,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-25 15:48:42,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 15:48:42,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:48:42,096 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:48:42,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:48:42,097 INFO L158 Benchmark]: Toolchain (without parser) took 4518.58ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 132.3MB in the beginning and 85.9MB in the end (delta: 46.4MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,098 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:48:42,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1247.87ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 127.0MB in the end (delta: 5.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.53ms. Allocated memory is still 161.5MB. Free memory was 127.0MB in the beginning and 123.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,099 INFO L158 Benchmark]: Boogie Preprocessor took 26.40ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 122.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:48:42,099 INFO L158 Benchmark]: RCFGBuilder took 558.12ms. Allocated memory is still 161.5MB. Free memory was 122.8MB in the beginning and 121.3MB in the end (delta: 1.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,099 INFO L158 Benchmark]: TraceAbstraction took 2564.51ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 121.3MB in the beginning and 89.1MB in the end (delta: 32.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,100 INFO L158 Benchmark]: Witness Printer took 56.27ms. Allocated memory is still 195.0MB. Free memory was 89.1MB in the beginning and 85.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:48:42,101 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1247.87ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 127.0MB in the end (delta: 5.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.53ms. Allocated memory is still 161.5MB. Free memory was 127.0MB in the beginning and 123.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.40ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 122.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 558.12ms. Allocated memory is still 161.5MB. Free memory was 122.8MB in the beginning and 121.3MB in the end (delta: 1.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2564.51ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 121.3MB in the beginning and 89.1MB in the end (delta: 32.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 56.27ms. Allocated memory is still 195.0MB. Free memory was 89.1MB in the beginning and 85.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1081 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 585 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 496 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 29 PreInvPairs, 34 NumberOfFragments, 93 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 64/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1637]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 15:48:42,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2faa953a-13f1-4574-a27b-05affa319943/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE