./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_15_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_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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 8fc1ba75e6470a800290e5af773fbb666f7d527395ebc6cebcb5aad871860a72 --- 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 16:49:13,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:49:13,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:49:13,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:49:13,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:49:13,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:49:13,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:49:13,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:49:13,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:49:13,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:49:13,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:49:13,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:49:13,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:49:13,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:49:13,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:49:13,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:49:13,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:49:13,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:49:13,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:49:13,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:49:13,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:49:13,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:49:13,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:49:13,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:49:13,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:49:13,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:49:13,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:49:13,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:49:13,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:49:13,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:49:13,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:49:13,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:49:13,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:49:13,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:49:13,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:49:13,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:49:13,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:49:13,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:49:13,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:49:13,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:49:13,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:49:13,823 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 16:49:13,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:49:13,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:49:13,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:49:13,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:49:13,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:49:13,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:49:13,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:49:13,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:49:13,858 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:49:13,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:49:13,859 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:49:13,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:49:13,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:49:13,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:49:13,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:49:13,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:49:13,861 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:49:13,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:49:13,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:49:13,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:49:13,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:49:13,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:49:13,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:49:13,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:49:13,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:49:13,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:49:13,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:49:13,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:49:13,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:49:13,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:49:13,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:49:13,864 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:49:13,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:49:13,865 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_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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 -> 8fc1ba75e6470a800290e5af773fbb666f7d527395ebc6cebcb5aad871860a72 [2022-11-25 16:49:14,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:49:14,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:49:14,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:49:14,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:49:14,192 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:49:14,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_15_good.i [2022-11-25 16:49:17,263 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:49:17,670 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:49:17,670 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_15_good.i [2022-11-25 16:49:17,689 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/data/0a80077b6/dea6a3677fb74dbc83baf5ec2257699c/FLAG48b26dd5b [2022-11-25 16:49:17,711 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/data/0a80077b6/dea6a3677fb74dbc83baf5ec2257699c [2022-11-25 16:49:17,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:49:17,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:49:17,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:49:17,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:49:17,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:49:17,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:49:17" (1/1) ... [2022-11-25 16:49:17,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1d2969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:17, skipping insertion in model container [2022-11-25 16:49:17,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:49:17" (1/1) ... [2022-11-25 16:49:17,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:49:17,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:49:18,230 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:49:18,678 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:49:18,684 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:49:18,688 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:49:18,697 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:49:18,700 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:49:18,768 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:49:18,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:49:18,784 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:49:18,824 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:49:18,890 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:49:18,891 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:49:18,892 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:49:18,894 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:49:18,895 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:49:18,904 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:49:18,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:49:19,033 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:49:19,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19 WrapperNode [2022-11-25 16:49:19,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:49:19,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:49:19,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:49:19,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:49:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,119 INFO L138 Inliner]: procedures = 503, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2022-11-25 16:49:19,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:49:19,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:49:19,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:49:19,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:49:19,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:49:19,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:49:19,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:49:19,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:49:19,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (1/1) ... [2022-11-25 16:49:19,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:49:19,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:19,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:49:19,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:49:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 16:49:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 16:49:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 16:49:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 16:49:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:49:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:49:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:49:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:49:19,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:49:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:49:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 16:49:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:49:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:49:19,517 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:49:19,519 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:49:19,898 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:49:19,905 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:49:19,906 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:49:19,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:19 BoogieIcfgContainer [2022-11-25 16:49:19,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:49:19,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:49:19,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:49:19,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:49:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:49:17" (1/3) ... [2022-11-25 16:49:19,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7f8e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:49:19, skipping insertion in model container [2022-11-25 16:49:19,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:19" (2/3) ... [2022-11-25 16:49:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7f8e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:49:19, skipping insertion in model container [2022-11-25 16:49:19,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:19" (3/3) ... [2022-11-25 16:49:19,917 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_15_good.i [2022-11-25 16:49:19,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:49:19,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 16:49:19,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:49:20,006 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;@68bbb337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:49:20,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 16:49:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 16:49:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:49:20,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:20,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:20,022 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 16:49:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-11-25 16:49:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885318402] [2022-11-25 16:49:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:20,675 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 16:49:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:20,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885318402] [2022-11-25 16:49:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885318402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:20,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:20,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053513460] [2022-11-25 16:49:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:20,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:20,737 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16:49:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:20,903 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-11-25 16:49:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2022-11-25 16:49:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:20,917 INFO L225 Difference]: With dead ends: 82 [2022-11-25 16:49:20,917 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 16:49:20,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:20,926 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 410 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 16:49:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-11-25 16:49:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.553191489361702) internal successors, (73), 65 states have internal predecessors, (73), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:49:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2022-11-25 16:49:20,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 15 [2022-11-25 16:49:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:20,978 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2022-11-25 16:49:20,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16:49:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2022-11-25 16:49:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:49:20,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:20,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:20,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:49:20,980 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 16:49:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -502744123, now seen corresponding path program 1 times [2022-11-25 16:49:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90167960] [2022-11-25 16:49:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,188 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 16:49:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:21,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90167960] [2022-11-25 16:49:21,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90167960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:21,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:21,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310854826] [2022-11-25 16:49:21,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:21,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:49:21,200 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:49:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:21,264 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2022-11-25 16:49:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-11-25 16:49:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:21,270 INFO L225 Difference]: With dead ends: 69 [2022-11-25 16:49:21,271 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 16:49:21,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 16:49:21,274 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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 16:49:21,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 16:49:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 16:49:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 64 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:49:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-11-25 16:49:21,299 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 16 [2022-11-25 16:49:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:21,300 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-11-25 16:49:21,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:49:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-11-25 16:49:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 16:49:21,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:21,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:21,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:49:21,304 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 16:49:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-11-25 16:49:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523047225] [2022-11-25 16:49:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,399 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 16:49:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:21,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523047225] [2022-11-25 16:49:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523047225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:21,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:21,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221412397] [2022-11-25 16:49:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:21,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:21,402 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 16:49:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:21,419 INFO L93 Difference]: Finished difference Result 119 states and 168 transitions. [2022-11-25 16:49:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:21,419 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), 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 20 [2022-11-25 16:49:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:21,421 INFO L225 Difference]: With dead ends: 119 [2022-11-25 16:49:21,421 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 16:49:21,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:49:21,423 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:21,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 16:49:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 16:49:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 64 states have internal predecessors, (71), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:49:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2022-11-25 16:49:21,432 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 20 [2022-11-25 16:49:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:21,432 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2022-11-25 16:49:21,433 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), 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 16:49:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2022-11-25 16:49:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 16:49:21,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:21,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:21,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:49:21,435 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 16:49:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1737287324, now seen corresponding path program 1 times [2022-11-25 16:49:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314545284] [2022-11-25 16:49:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,589 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 16:49:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314545284] [2022-11-25 16:49:21,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314545284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:21,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581915935] [2022-11-25 16:49:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:21,593 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:49:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:21,687 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2022-11-25 16:49:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:21,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 21 [2022-11-25 16:49:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:21,691 INFO L225 Difference]: With dead ends: 69 [2022-11-25 16:49:21,692 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 16:49:21,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:21,701 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 7 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:21,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 330 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 16:49:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-11-25 16:49:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:49:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-11-25 16:49:21,710 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 21 [2022-11-25 16:49:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:21,710 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-11-25 16:49:21,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:49:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-11-25 16:49:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 16:49:21,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:21,715 INFO L195 NwaCegarLoop]: trace histogram [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 16:49:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:49:21,716 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 16:49:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1978667920, now seen corresponding path program 1 times [2022-11-25 16:49:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480204824] [2022-11-25 16:49:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,899 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 16:49:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480204824] [2022-11-25 16:49:21,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480204824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:21,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:21,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077088375] [2022-11-25 16:49:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:21,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:21,910 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 16:49:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:21,965 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2022-11-25 16:49:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-11-25 16:49:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:21,974 INFO L225 Difference]: With dead ends: 67 [2022-11-25 16:49:21,974 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 16:49:21,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:21,979 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:21,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 16:49:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 16:49:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:49:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2022-11-25 16:49:22,004 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 22 [2022-11-25 16:49:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,005 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2022-11-25 16:49:22,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 16:49:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-11-25 16:49:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:49:22,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,009 INFO L195 NwaCegarLoop]: trace histogram [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 16:49:22,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:49:22,010 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 16:49:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash 931316271, now seen corresponding path program 1 times [2022-11-25 16:49:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78022833] [2022-11-25 16:49:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,064 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 16:49:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78022833] [2022-11-25 16:49:22,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78022833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564032188] [2022-11-25 16:49:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,066 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,076 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2022-11-25 16:49:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2022-11-25 16:49:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,078 INFO L225 Difference]: With dead ends: 100 [2022-11-25 16:49:22,078 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 16:49:22,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:49:22,079 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 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 16:49:22,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 16:49:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 16:49:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:49:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-11-25 16:49:22,086 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 27 [2022-11-25 16:49:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,086 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-11-25 16:49:22,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-11-25 16:49:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:49:22,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,087 INFO L195 NwaCegarLoop]: trace histogram [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 16:49:22,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:49:22,088 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 16:49:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash -346159942, now seen corresponding path program 1 times [2022-11-25 16:49:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226098957] [2022-11-25 16:49:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,164 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 16:49:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226098957] [2022-11-25 16:49:22,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226098957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:49:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89331019] [2022-11-25 16:49:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,168 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,192 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2022-11-25 16:49:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2022-11-25 16:49:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,195 INFO L225 Difference]: With dead ends: 102 [2022-11-25 16:49:22,195 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 16:49:22,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 16:49:22,196 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:22,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 16:49:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2022-11-25 16:49:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 states have internal predecessors, (72), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:49:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2022-11-25 16:49:22,206 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 27 [2022-11-25 16:49:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,206 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2022-11-25 16:49:22,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2022-11-25 16:49:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:49:22,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,208 INFO L195 NwaCegarLoop]: trace histogram [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 16:49:22,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:49:22,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:49:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash -344312900, now seen corresponding path program 1 times [2022-11-25 16:49:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793845246] [2022-11-25 16:49:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,262 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 16:49:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793845246] [2022-11-25 16:49:22,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793845246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902973721] [2022-11-25 16:49:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,265 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,276 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2022-11-25 16:49:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2022-11-25 16:49:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,278 INFO L225 Difference]: With dead ends: 98 [2022-11-25 16:49:22,278 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 16:49:22,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:49:22,280 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 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 16:49:22,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 16:49:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-25 16:49:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.392156862745098) internal successors, (71), 64 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:49:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-11-25 16:49:22,301 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 27 [2022-11-25 16:49:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,303 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-11-25 16:49:22,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:49:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-11-25 16:49:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:49:22,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,310 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, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:49:22,310 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:49:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -765823701, now seen corresponding path program 1 times [2022-11-25 16:49:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892483271] [2022-11-25 16:49:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 16:49:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,390 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 16:49:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892483271] [2022-11-25 16:49:22,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892483271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662106734] [2022-11-25 16:49:22,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,398 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 16:49:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,410 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2022-11-25 16:49:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2022-11-25 16:49:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,412 INFO L225 Difference]: With dead ends: 91 [2022-11-25 16:49:22,412 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 16:49:22,412 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 16:49:22,415 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:22,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 16:49:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 16:49:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:49:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-11-25 16:49:22,427 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 31 [2022-11-25 16:49:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,428 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-11-25 16:49:22,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 16:49:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-11-25 16:49:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:49:22,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,430 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-11-25 16:49:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:49:22,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:49:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash -37290577, now seen corresponding path program 1 times [2022-11-25 16:49:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28925434] [2022-11-25 16:49:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,498 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 16:49:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28925434] [2022-11-25 16:49:22,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28925434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267562290] [2022-11-25 16:49:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,501 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 16:49:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,509 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-11-25 16:49:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 33 [2022-11-25 16:49:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,512 INFO L225 Difference]: With dead ends: 77 [2022-11-25 16:49:22,513 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 16:49:22,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 16:49:22,516 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 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 16:49:22,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 16:49:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 16:49:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 54 states have internal predecessors, (58), 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 16:49:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2022-11-25 16:49:22,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 33 [2022-11-25 16:49:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,528 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2022-11-25 16:49:22,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 16:49:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-11-25 16:49:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:49:22,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,531 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:49:22,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:49:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash 362646512, now seen corresponding path program 1 times [2022-11-25 16:49:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135271803] [2022-11-25 16:49:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 16:49:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,627 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 16:49:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135271803] [2022-11-25 16:49:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135271803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:49:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959935160] [2022-11-25 16:49:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,631 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 16:49:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,643 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-11-25 16:49:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2022-11-25 16:49:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,645 INFO L225 Difference]: With dead ends: 66 [2022-11-25 16:49:22,645 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 16:49:22,645 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 16:49:22,646 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:22,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 16:49:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 16:49:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 54 states have internal predecessors, (57), 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 16:49:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2022-11-25 16:49:22,654 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 39 [2022-11-25 16:49:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,655 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2022-11-25 16:49:22,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 16:49:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-11-25 16:49:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 16:49:22,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,656 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:22,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:49:22,656 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:49:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1587540878, now seen corresponding path program 1 times [2022-11-25 16:49:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:22,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691173019] [2022-11-25 16:49:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:49:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 16:49:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,716 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 16:49:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691173019] [2022-11-25 16:49:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691173019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437090164] [2022-11-25 16:49:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:22,719 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 16:49:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,726 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-11-25 16:49:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 40 [2022-11-25 16:49:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,728 INFO L225 Difference]: With dead ends: 63 [2022-11-25 16:49:22,728 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:49:22,729 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 16:49:22,730 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:22,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:49:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:49:22,731 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 16:49:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:49:22,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-11-25 16:49:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,732 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:49:22,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 16:49:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:49:22,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:49:22,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 16:49:22,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 16:49:22,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 16:49:22,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 16:49:22,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 16:49:22,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 16:49:22,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 16:49:22,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 16:49:22,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:49:22,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:49:22,804 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 16:49:22,804 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:49:22,804 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 16:49:22,804 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:49:22,805 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:49:22,805 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 16:49:22,805 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:49:22,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-25 16:49:22,805 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 16:49:22,805 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch105#1| [2022-11-25 16:49:22,806 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 16:49:22,806 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-25 16:49:22,806 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-25 16:49:22,806 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-25 16:49:22,806 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|)) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-11-25 16:49:22,806 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-25 16:49:22,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 16:49:22,807 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-25 16:49:22,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 16:49:22,807 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch94#1| [2022-11-25 16:49:22,807 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-25 16:49:22,807 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-11-25 16:49:22,808 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-11-25 16:49:22,808 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) [2022-11-25 16:49:22,808 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-11-25 16:49:22,809 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-25 16:49:22,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-25 16:49:22,810 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-25 16:49:22,810 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-11-25 16:49:22,810 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-11-25 16:49:22,810 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-11-25 16:49:22,810 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 16:49:22,810 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-11-25 16:49:22,811 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= 1 (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|))) [2022-11-25 16:49:22,811 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-25 16:49:22,811 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-11-25 16:49:22,811 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 16:49:22,812 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-11-25 16:49:22,812 INFO L902 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: true [2022-11-25 16:49:22,812 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-25 16:49:22,812 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-25 16:49:22,812 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-11-25 16:49:22,812 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-11-25 16:49:22,812 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-25 16:49:22,813 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-11-25 16:49:22,813 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-11-25 16:49:22,813 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-11-25 16:49:22,813 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-25 16:49:22,813 INFO L902 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: true [2022-11-25 16:49:22,813 INFO L902 garLoopResultBuilder]: At program point L1683(lines 1677 1684) the Hoare annotation is: true [2022-11-25 16:49:22,814 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (and (<= 1 (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|)) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-11-25 16:49:22,814 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 16:49:22,815 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-11-25 16:49:22,815 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:49:22,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-25 16:49:22,815 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-11-25 16:49:22,815 INFO L902 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: true [2022-11-25 16:49:22,816 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-11-25 16:49:22,816 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch105#1| [2022-11-25 16:49:22,816 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-25 16:49:22,816 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-11-25 16:49:22,816 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-11-25 16:49:22,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:49:22,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-25 16:49:22,817 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch94#1| [2022-11-25 16:49:22,817 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-11-25 16:49:22,817 INFO L902 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: true [2022-11-25 16:49:22,817 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-11-25 16:49:22,818 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= 1 (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|))) [2022-11-25 16:49:22,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-25 16:49:22,818 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 16:49:22,818 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-11-25 16:49:22,819 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch100#1| [2022-11-25 16:49:22,819 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-11-25 16:49:22,819 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch104#1|) [2022-11-25 16:49:22,819 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 16:49:22,819 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-11-25 16:49:22,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-25 16:49:22,820 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-11-25 16:49:22,820 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-11-25 16:49:22,820 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-11-25 16:49:22,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:22,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:49:22,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:49:22 BoogieIcfgContainer [2022-11-25 16:49:22,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:49:22,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:49:22,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:49:22,848 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:49:22,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:19" (3/4) ... [2022-11-25 16:49:22,851 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 16:49:22,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 16:49:22,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 16:49:22,863 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 16:49:22,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 16:49:22,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 16:49:22,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:49:22,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:49:22,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:49:22,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:49:22,910 INFO L158 Benchmark]: Toolchain (without parser) took 5192.45ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 152.0MB in the beginning and 92.0MB in the end (delta: 60.0MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,911 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:49:22,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1312.54ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 90.8MB in the end (delta: 61.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.03ms. Allocated memory is still 182.5MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,912 INFO L158 Benchmark]: Boogie Preprocessor took 56.82ms. Allocated memory is still 182.5MB. Free memory was 87.5MB in the beginning and 86.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:49:22,912 INFO L158 Benchmark]: RCFGBuilder took 730.92ms. Allocated memory is still 182.5MB. Free memory was 86.3MB in the beginning and 147.9MB in the end (delta: -61.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,912 INFO L158 Benchmark]: TraceAbstraction took 2936.71ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 147.9MB in the beginning and 97.3MB in the end (delta: 50.7MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,913 INFO L158 Benchmark]: Witness Printer took 62.18ms. Allocated memory is still 220.2MB. Free memory was 97.3MB in the beginning and 92.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 16:49:22,914 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.30ms. Allocated memory is still 125.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1312.54ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 90.8MB in the end (delta: 61.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.03ms. Allocated memory is still 182.5MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.82ms. Allocated memory is still 182.5MB. Free memory was 87.5MB in the beginning and 86.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 730.92ms. Allocated memory is still 182.5MB. Free memory was 86.3MB in the beginning and 147.9MB in the end (delta: -61.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2936.71ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 147.9MB in the beginning and 97.3MB in the end (delta: 50.7MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 62.18ms. Allocated memory is still 220.2MB. Free memory was 97.3MB in the beginning and 92.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 2620 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1573 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1047 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 61 PreInvPairs, 71 NumberOfFragments, 65 HoareAnnotationTreeSize, 61 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4/4 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: 1595]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1629]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: 2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux - InvariantResult [Line: 1647]: Loop Invariant Derived loop invariant: data == 2 - InvariantResult [Line: 1677]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 16:49:22,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fd31438-387a-4e45-afe4-f2680f2a2ab5/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