./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro --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 41b46cae14752bbf818c00843f21a60e8a9ff457c697e732204ac3392d940a5c --- 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-8393723 [2022-11-18 20:47:15,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:47:15,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:47:15,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:47:15,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:47:15,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:47:15,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:47:15,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:47:15,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:47:15,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:47:15,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:47:15,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:47:15,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:47:15,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:47:15,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:47:15,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:47:15,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:47:15,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:47:15,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:47:15,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:47:15,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:47:15,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:47:15,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:47:15,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:47:15,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:47:15,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:47:15,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:47:15,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:47:15,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:47:15,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:47:15,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:47:15,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:47:15,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:47:15,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:47:15,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:47:15,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:47:15,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:47:15,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:47:15,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:47:15,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:47:15,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:47:15,755 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:47:15,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:47:15,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:47:15,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:47:15,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:47:15,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:47:15,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:47:15,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:47:15,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:47:15,802 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:47:15,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:47:15,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:47:15,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:47:15,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:47:15,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:47:15,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:47:15,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:47:15,805 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:47:15,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:47:15,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:47:15,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:47:15,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:47:15,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:47:15,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:47:15,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:47:15,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:47:15,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:47:15,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:47:15,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:47:15,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:47:15,808 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:47:15,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:47:15,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:47:15,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/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_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro 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 -> 41b46cae14752bbf818c00843f21a60e8a9ff457c697e732204ac3392d940a5c [2022-11-18 20:47:16,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:47:16,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:47:16,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:47:16,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:47:16,081 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:47:16,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2022-11-18 20:47:16,147 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/data/e276b60e7/2311597ab61b492ba62251aef093d79b/FLAG35fd65f1d [2022-11-18 20:47:16,748 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:47:16,762 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2022-11-18 20:47:16,794 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/data/e276b60e7/2311597ab61b492ba62251aef093d79b/FLAG35fd65f1d [2022-11-18 20:47:17,003 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/data/e276b60e7/2311597ab61b492ba62251aef093d79b [2022-11-18 20:47:17,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:47:17,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:47:17,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:47:17,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:47:17,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:47:17,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:17" (1/1) ... [2022-11-18 20:47:17,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef57215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:17, skipping insertion in model container [2022-11-18 20:47:17,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:17" (1/1) ... [2022-11-18 20:47:17,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:47:17,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:47:17,485 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:47:18,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:47:18,136 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:47:18,153 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:47:18,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:47:18,357 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:47:18,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18 WrapperNode [2022-11-18 20:47:18,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:47:18,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:47:18,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:47:18,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:47:18,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,418 INFO L138 Inliner]: procedures = 503, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 163 [2022-11-18 20:47:18,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:47:18,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:47:18,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:47:18,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:47:18,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,446 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:47:18,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:47:18,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:47:18,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:47:18,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (1/1) ... [2022-11-18 20:47:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:47:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:47:18,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:47:18,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:47:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-18 20:47:18,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-18 20:47:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-18 20:47:18,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-18 20:47:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:47:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:47:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:47:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:47:18,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:47:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:47:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-18 20:47:18,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:47:18,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:47:18,776 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:47:18,791 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:47:19,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:47:19,061 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:47:19,061 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:47:19,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:19 BoogieIcfgContainer [2022-11-18 20:47:19,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:47:19,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:47:19,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:47:19,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:47:19,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:47:17" (1/3) ... [2022-11-18 20:47:19,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ceb317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:19, skipping insertion in model container [2022-11-18 20:47:19,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:18" (2/3) ... [2022-11-18 20:47:19,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ceb317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:19, skipping insertion in model container [2022-11-18 20:47:19,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:19" (3/3) ... [2022-11-18 20:47:19,073 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2022-11-18 20:47:19,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:47:19,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-18 20:47:19,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:47:19,150 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;@60648a04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:47:19,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-18 20:47:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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-18 20:47:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:47:19,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:19,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:19,165 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-18 20:47:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-11-18 20:47:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:19,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009523741] [2022-11-18 20:47:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:19,869 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-18 20:47:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009523741] [2022-11-18 20:47:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009523741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:19,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:19,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637492106] [2022-11-18 20:47:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:19,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:47:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:19,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:47:19,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:47:19,929 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 20:47:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:20,060 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-11-18 20:47:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:47:20,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-11-18 20:47:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:20,083 INFO L225 Difference]: With dead ends: 77 [2022-11-18 20:47:20,089 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:47:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:47:20,101 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:20,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 280 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:47:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:47:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:47:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 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-18 20:47:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2022-11-18 20:47:20,172 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2022-11-18 20:47:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:20,173 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2022-11-18 20:47:20,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 20:47:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-11-18 20:47:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:47:20,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:20,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:47:20,176 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-18 20:47:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 804416791, now seen corresponding path program 1 times [2022-11-18 20:47:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570319718] [2022-11-18 20:47:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,457 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-18 20:47:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570319718] [2022-11-18 20:47:20,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570319718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:20,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:20,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66740840] [2022-11-18 20:47:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:47:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:47:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:47:20,462 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-18 20:47:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:20,498 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-11-18 20:47:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:47:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-18 20:47:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:20,504 INFO L225 Difference]: With dead ends: 65 [2022-11-18 20:47:20,504 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 20:47:20,505 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-18 20:47:20,507 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:20,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 20:47:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-18 20:47:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 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-18 20:47:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2022-11-18 20:47:20,518 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 15 [2022-11-18 20:47:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:20,518 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2022-11-18 20:47:20,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-18 20:47:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-11-18 20:47:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:47:20,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:20,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:20,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:47:20,520 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-18 20:47:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-11-18 20:47:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:20,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064802111] [2022-11-18 20:47:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,609 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-18 20:47:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064802111] [2022-11-18 20:47:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064802111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833593265] [2022-11-18 20:47:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:20,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:20,616 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-18 20:47:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:20,644 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2022-11-18 20:47:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-18 20:47:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:20,649 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:47:20,649 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 20:47:20,651 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-18 20:47:20,654 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 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-18 20:47:20,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 20:47:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-18 20:47:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 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-18 20:47:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-11-18 20:47:20,666 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 19 [2022-11-18 20:47:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:20,667 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-11-18 20:47:20,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-18 20:47:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-11-18 20:47:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:47:20,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:20,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:20,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:47:20,669 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-18 20:47:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-11-18 20:47:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773238423] [2022-11-18 20:47:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:47:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:20,738 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-18 20:47:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773238423] [2022-11-18 20:47:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773238423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:20,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130276057] [2022-11-18 20:47:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:20,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:20,741 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-18 20:47:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:20,774 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2022-11-18 20:47:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-11-18 20:47:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:20,777 INFO L225 Difference]: With dead ends: 112 [2022-11-18 20:47:20,778 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:47:20,778 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-18 20:47:20,783 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:20,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:47:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 20:47:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 58 states have internal predecessors, (63), 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-18 20:47:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-18 20:47:20,791 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 23 [2022-11-18 20:47:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:20,792 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-18 20:47:20,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-18 20:47:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-18 20:47:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:47:20,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:20,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:47:20,794 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-11-18 20:47:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:20,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502717296] [2022-11-18 20:47:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,041 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-18 20:47:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502717296] [2022-11-18 20:47:21,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502717296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:47:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037550737] [2022-11-18 20:47:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:47:21,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:47:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:47:21,043 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-18 20:47:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,147 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-11-18 20:47:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:47:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 25 [2022-11-18 20:47:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,150 INFO L225 Difference]: With dead ends: 63 [2022-11-18 20:47:21,150 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 20:47:21,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:47:21,151 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:21,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 276 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:47:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 20:47:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 20:47:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 57 states have internal predecessors, (62), 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-18 20:47:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-11-18 20:47:21,166 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 25 [2022-11-18 20:47:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,167 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-11-18 20:47:21,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-18 20:47:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-11-18 20:47:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:47:21,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,171 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] [2022-11-18 20:47:21,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:47:21,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1637153456, now seen corresponding path program 1 times [2022-11-18 20:47:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521911860] [2022-11-18 20:47:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,281 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-18 20:47:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521911860] [2022-11-18 20:47:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521911860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225941998] [2022-11-18 20:47:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:47:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:47:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:47:21,284 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 20:47:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,318 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-11-18 20:47:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:47:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 26 [2022-11-18 20:47:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,321 INFO L225 Difference]: With dead ends: 62 [2022-11-18 20:47:21,321 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:47:21,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:47:21,323 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:21,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:47:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-18 20:47:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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-18 20:47:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2022-11-18 20:47:21,358 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 26 [2022-11-18 20:47:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,358 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-11-18 20:47:21,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 20:47:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2022-11-18 20:47:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 20:47:21,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,360 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-18 20:47:21,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:47:21,361 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-18 20:47:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-11-18 20:47:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922851174] [2022-11-18 20:47:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,445 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-18 20:47:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922851174] [2022-11-18 20:47:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922851174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031600074] [2022-11-18 20:47:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,447 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-18 20:47:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,459 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-11-18 20:47:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:21,460 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), 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 31 [2022-11-18 20:47:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,462 INFO L225 Difference]: With dead ends: 93 [2022-11-18 20:47:21,462 INFO L226 Difference]: Without dead ends: 59 [2022-11-18 20:47:21,463 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-18 20:47:21,464 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 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-18 20:47:21,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-18 20:47:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-18 20:47:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:47:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-11-18 20:47:21,484 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 31 [2022-11-18 20:47:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,484 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-11-18 20:47:21,484 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), 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-18 20:47:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-11-18 20:47:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:47:21,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:21,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:47:21,486 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-18 20:47:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-11-18 20:47:21,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266514890] [2022-11-18 20:47:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266514890] [2022-11-18 20:47:21,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266514890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:47:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915388967] [2022-11-18 20:47:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,592 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,612 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2022-11-18 20:47:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:21,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-18 20:47:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,614 INFO L225 Difference]: With dead ends: 78 [2022-11-18 20:47:21,614 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 20:47:21,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,615 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 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-18 20:47:21,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 20:47:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2022-11-18 20:47:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:47:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-11-18 20:47:21,632 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 36 [2022-11-18 20:47:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,634 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-11-18 20:47:21,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-11-18 20:47:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:47:21,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:21,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:47:21,638 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-18 20:47:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1965463566, now seen corresponding path program 1 times [2022-11-18 20:47:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660489799] [2022-11-18 20:47:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660489799] [2022-11-18 20:47:21,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660489799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233373502] [2022-11-18 20:47:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,724 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,736 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2022-11-18 20:47:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:21,737 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-18 20:47:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,739 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:47:21,739 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 20:47:21,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-18 20:47:21,743 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 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-18 20:47:21,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 20:47:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 20:47:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 55 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:47:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-18 20:47:21,756 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 36 [2022-11-18 20:47:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,757 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-18 20:47:21,757 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-18 20:47:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:47:21,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:47:21,763 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash -801675300, now seen corresponding path program 1 times [2022-11-18 20:47:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638052997] [2022-11-18 20:47:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638052997] [2022-11-18 20:47:21,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638052997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:47:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018193740] [2022-11-18 20:47:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,840 INFO L87 Difference]: Start difference. First operand 62 states and 83 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,853 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-11-18 20:47:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:21,853 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-18 20:47:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,855 INFO L225 Difference]: With dead ends: 62 [2022-11-18 20:47:21,857 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:47:21,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,858 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 126 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-18 20:47:21,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:47:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-18 20:47:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 54 states have internal predecessors, (60), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:47:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2022-11-18 20:47:21,868 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 37 [2022-11-18 20:47:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,869 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-11-18 20:47:21,870 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2022-11-18 20:47:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:47:21,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-18 20:47:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:47:21,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2019412551, now seen corresponding path program 1 times [2022-11-18 20:47:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497968246] [2022-11-18 20:47:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:47:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:47:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:21,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497968246] [2022-11-18 20:47:21,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497968246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:21,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:21,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118192959] [2022-11-18 20:47:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:21,972 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:47:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:21,979 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-11-18 20:47:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-11-18 20:47:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:21,981 INFO L225 Difference]: With dead ends: 83 [2022-11-18 20:47:21,982 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:47:21,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-18 20:47:21,985 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 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-18 20:47:21,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:47:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-18 20:47:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 50 states have internal predecessors, (54), 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-18 20:47:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-11-18 20:47:21,996 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 40 [2022-11-18 20:47:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:21,997 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-11-18 20:47:21,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:47:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-11-18 20:47:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:47:21,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:21,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:21,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:47:21,999 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-18 20:47:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-11-18 20:47:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395739518] [2022-11-18 20:47:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:22,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395739518] [2022-11-18 20:47:22,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395739518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:22,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:22,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056845819] [2022-11-18 20:47:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:22,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:22,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:22,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,063 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:22,073 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-18 20:47:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:22,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-11-18 20:47:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:22,074 INFO L225 Difference]: With dead ends: 71 [2022-11-18 20:47:22,074 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 20:47:22,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-18 20:47:22,075 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 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-18 20:47:22,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 20:47:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-18 20:47:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 47 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:47:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-18 20:47:22,080 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 42 [2022-11-18 20:47:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:22,080 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-18 20:47:22,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:47:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-18 20:47:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-18 20:47:22,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:22,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:47:22,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-11-18 20:47:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:22,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690869902] [2022-11-18 20:47:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:47:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690869902] [2022-11-18 20:47:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690869902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:22,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:22,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:47:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938389204] [2022-11-18 20:47:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:22,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,150 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:22,160 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-11-18 20:47:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:22,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-11-18 20:47:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:22,161 INFO L225 Difference]: With dead ends: 59 [2022-11-18 20:47:22,161 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 20:47:22,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,162 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:22,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 20:47:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-11-18 20:47:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:47:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-11-18 20:47:22,167 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 47 [2022-11-18 20:47:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:22,167 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-11-18 20:47:22,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-11-18 20:47:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:47:22,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:22,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:47:22,169 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1807677031, now seen corresponding path program 1 times [2022-11-18 20:47:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:22,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356843388] [2022-11-18 20:47:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:47:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:22,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356843388] [2022-11-18 20:47:22,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356843388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:22,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:22,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:47:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368446809] [2022-11-18 20:47:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,233 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:22,239 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-11-18 20:47:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:22,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-18 20:47:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:22,241 INFO L225 Difference]: With dead ends: 57 [2022-11-18 20:47:22,241 INFO L226 Difference]: Without dead ends: 52 [2022-11-18 20:47:22,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,242 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:22,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-18 20:47:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-18 20:47:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.2) internal successors, (48), 45 states have internal predecessors, (48), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:47:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-11-18 20:47:22,246 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 48 [2022-11-18 20:47:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:22,246 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-11-18 20:47:22,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-11-18 20:47:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:47:22,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:22,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:22,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:47:22,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:47:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1809461544, now seen corresponding path program 1 times [2022-11-18 20:47:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173446749] [2022-11-18 20:47:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:47:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:47:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 20:47:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:47:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:22,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173446749] [2022-11-18 20:47:22,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173446749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:22,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:22,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:47:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372173263] [2022-11-18 20:47:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:22,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:47:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:47:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:47:22,327 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:22,330 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-11-18 20:47:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:47:22,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-18 20:47:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:22,331 INFO L225 Difference]: With dead ends: 56 [2022-11-18 20:47:22,331 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:47:22,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-18 20:47:22,332 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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-18 20:47:22,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:47:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:47:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:47:22,333 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-18 20:47:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:47:22,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-11-18 20:47:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:22,333 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:47:22,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:47:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:47:22,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:47:22,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-18 20:47:22,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-18 20:47:22,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-18 20:47:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-18 20:47:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-18 20:47:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-18 20:47:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-18 20:47:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-18 20:47:22,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:47:22,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:47:22,445 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-18 20:47:22,445 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:47:22,445 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-18 20:47:22,445 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:47:22,445 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:47:22,445 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-18 20:47:22,446 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:47:22,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-11-18 20:47:22,446 INFO L899 garLoopResultBuilder]: For program point L1662(lines 1662 1668) no Hoare annotation was computed. [2022-11-18 20:47:22,446 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-18 20:47:22,446 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-11-18 20:47:22,446 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-18 20:47:22,446 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: false [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:47:22,447 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-18 20:47:22,448 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-18 20:47:22,448 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-18 20:47:22,448 INFO L895 garLoopResultBuilder]: At program point L1614(lines 1614 1622) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) |ULTIMATE.start_goodG2B1_#t~switch102#1| (<= 0 .cse0))) [2022-11-18 20:47:22,448 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1578) no Hoare annotation was computed. [2022-11-18 20:47:22,448 INFO L902 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: true [2022-11-18 20:47:22,448 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-11-18 20:47:22,449 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2022-11-18 20:47:22,449 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-18 20:47:22,449 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-18 20:47:22,449 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-18 20:47:22,449 INFO L895 garLoopResultBuilder]: At program point L1623(lines 1623 1634) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-18 20:47:22,449 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-18 20:47:22,450 INFO L895 garLoopResultBuilder]: At program point L1640(lines 1640 1648) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-11-18 20:47:22,450 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-18 20:47:22,450 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: false [2022-11-18 20:47:22,450 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-18 20:47:22,450 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-11-18 20:47:22,450 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-18 20:47:22,450 INFO L902 garLoopResultBuilder]: At program point L1649(lines 1649 1660) the Hoare annotation is: true [2022-11-18 20:47:22,450 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2022-11-18 20:47:22,451 INFO L895 garLoopResultBuilder]: At program point L1583(lines 1583 1591) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-18 20:47:22,451 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-18 20:47:22,451 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2022-11-18 20:47:22,451 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1575) no Hoare annotation was computed. [2022-11-18 20:47:22,451 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-18 20:47:22,451 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-18 20:47:22,451 INFO L895 garLoopResultBuilder]: At program point L1592(lines 1592 1608) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-18 20:47:22,451 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2022-11-18 20:47:22,452 INFO L902 garLoopResultBuilder]: At program point L1675(lines 1669 1676) the Hoare annotation is: true [2022-11-18 20:47:22,452 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-11-18 20:47:22,452 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:47:22,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-11-18 20:47:22,452 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-11-18 20:47:22,452 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-11-18 20:47:22,452 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1635) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-18 20:47:22,453 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2022-11-18 20:47:22,454 INFO L899 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2022-11-18 20:47:22,454 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1577) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-18 20:47:22,454 INFO L899 garLoopResultBuilder]: For program point L1619(line 1619) no Hoare annotation was computed. [2022-11-18 20:47:22,454 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1661) no Hoare annotation was computed. [2022-11-18 20:47:22,454 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-18 20:47:22,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-11-18 20:47:22,454 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1595(lines 1595 1603) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1609) no Hoare annotation was computed. [2022-11-18 20:47:22,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-18 20:47:22,458 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:22,461 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:47:22,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:47:22 BoogieIcfgContainer [2022-11-18 20:47:22,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:47:22,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:47:22,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:47:22,484 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:47:22,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:19" (3/4) ... [2022-11-18 20:47:22,488 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:47:22,495 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-18 20:47:22,495 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-18 20:47:22,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-18 20:47:22,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-18 20:47:22,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 20:47:22,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:47:22,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:47:22,548 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:47:22,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:47:22,549 INFO L158 Benchmark]: Toolchain (without parser) took 5540.95ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 79.2MB in the beginning and 117.6MB in the end (delta: -38.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-18 20:47:22,549 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:47:22,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1348.65ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.2MB in the beginning and 94.7MB in the end (delta: -15.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2022-11-18 20:47:22,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.04ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 91.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:47:22,550 INFO L158 Benchmark]: Boogie Preprocessor took 31.88ms. Allocated memory is still 134.2MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:47:22,550 INFO L158 Benchmark]: RCFGBuilder took 611.97ms. Allocated memory is still 134.2MB. Free memory was 89.8MB in the beginning and 72.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:47:22,551 INFO L158 Benchmark]: TraceAbstraction took 3418.02ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 71.6MB in the beginning and 122.8MB in the end (delta: -51.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:47:22,551 INFO L158 Benchmark]: Witness Printer took 64.21ms. Allocated memory is still 161.5MB. Free memory was 122.8MB in the beginning and 117.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:47:22,553 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.28ms. Allocated memory is still 111.1MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1348.65ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.2MB in the beginning and 94.7MB in the end (delta: -15.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.04ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 91.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.88ms. Allocated memory is still 134.2MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 611.97ms. Allocated memory is still 134.2MB. Free memory was 89.8MB in the beginning and 72.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3418.02ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 71.6MB in the beginning and 122.8MB in the end (delta: -51.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 64.21ms. Allocated memory is still 161.5MB. Free memory was 122.8MB in the beginning and 117.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 2597 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1431 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1166 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 68 PreInvPairs, 78 NumberOfFragments, 137 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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: 1614]: Loop Invariant Derived loop invariant: (2 + data <= 0 && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && 0 <= 2 + data - InvariantResult [Line: 1640]: Loop Invariant Derived loop invariant: (0 <= data + 2 && data + 2 <= 0) && 0 <= 2 + data - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { int result = data - 1; printIntLine(result); } else { printLine("data value is too large to perform subtraction."); } break; }-aux && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1583]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1623]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: { int result = data - 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= 2 + data - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { int result = data - 1; printIntLine(result); } else { printLine("data value is too large to perform subtraction."); } break; default: printLine("Benign, fixed string"); break; }-aux && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1649]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-18 20:47:22,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eba5178-7280-46f2-975b-6d73b57afa36/bin/uautomizer-TMbwUNV5ro/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